/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 03:33:58,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 03:33:58,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 03:33:58,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 03:33:58,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 03:33:58,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 03:33:58,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 03:33:58,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 03:33:58,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 03:33:58,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 03:33:58,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 03:33:58,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 03:33:58,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 03:33:58,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 03:33:58,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 03:33:58,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 03:33:58,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 03:33:58,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 03:33:58,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 03:33:58,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 03:33:58,177 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 03:33:58,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 03:33:58,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 03:33:58,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 03:33:58,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 03:33:58,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 03:33:58,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 03:33:58,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 03:33:58,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 03:33:58,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 03:33:58,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 03:33:58,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 03:33:58,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 03:33:58,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 03:33:58,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 03:33:58,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 03:33:58,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 03:33:58,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 03:33:58,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 03:33:58,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 03:33:58,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 03:33:58,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 03:33:58,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 03:33:58,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 03:33:58,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 03:33:58,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 03:33:58,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 03:33:58,217 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 03:33:58,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 03:33:58,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 03:33:58,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 03:33:58,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 03:33:58,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 03:33:58,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 03:33:58,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 03:33:58,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 03:33:58,223 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 03:33:58,224 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 03:33:58,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 03:33:58,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 03:33:58,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 03:33:58,448 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 03:33:58,449 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 03:33:58,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2022-03-20 03:33:58,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d957929/fff0a25d1d924f8792509d1fe1456850/FLAGced4cb67d [2022-03-20 03:33:58,867 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 03:33:58,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2022-03-20 03:33:58,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d957929/fff0a25d1d924f8792509d1fe1456850/FLAGced4cb67d [2022-03-20 03:33:58,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d957929/fff0a25d1d924f8792509d1fe1456850 [2022-03-20 03:33:58,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 03:33:58,889 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 03:33:58,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 03:33:58,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 03:33:58,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 03:33:58,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 03:33:58" (1/1) ... [2022-03-20 03:33:58,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610cc6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:58, skipping insertion in model container [2022-03-20 03:33:58,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 03:33:58" (1/1) ... [2022-03-20 03:33:58,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 03:33:58,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 03:33:59,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c[322,335] [2022-03-20 03:33:59,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 03:33:59,081 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 03:33:59,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c[322,335] [2022-03-20 03:33:59,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 03:33:59,124 INFO L208 MainTranslator]: Completed translation [2022-03-20 03:33:59,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59 WrapperNode [2022-03-20 03:33:59,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 03:33:59,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 03:33:59,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 03:33:59,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 03:33:59,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 03:33:59,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 03:33:59,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 03:33:59,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 03:33:59,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 03:33:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:33:59,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 03:33:59,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 03:33:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 03:33:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 03:33:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 03:33:59,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 03:33:59,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 03:33:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 03:33:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 03:33:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 03:33:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 03:33:59,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 03:33:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 03:33:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 03:33:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 03:33:59,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 03:33:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 03:33:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 03:33:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 03:33:59,282 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 03:33:59,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 03:33:59,397 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 03:33:59,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 03:33:59,402 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 03:33:59,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:33:59 BoogieIcfgContainer [2022-03-20 03:33:59,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 03:33:59,404 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 03:33:59,404 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 03:33:59,405 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 03:33:59,407 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:33:59" (1/1) ... [2022-03-20 03:33:59,409 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 03:33:59,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 03:33:59 BasicIcfg [2022-03-20 03:33:59,420 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 03:33:59,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 03:33:59,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 03:33:59,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 03:33:59,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 03:33:58" (1/4) ... [2022-03-20 03:33:59,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7f08f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 03:33:59, skipping insertion in model container [2022-03-20 03:33:59,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 03:33:59" (2/4) ... [2022-03-20 03:33:59,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7f08f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 03:33:59, skipping insertion in model container [2022-03-20 03:33:59,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 03:33:59" (3/4) ... [2022-03-20 03:33:59,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7f08f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 03:33:59, skipping insertion in model container [2022-03-20 03:33:59,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 03:33:59" (4/4) ... [2022-03-20 03:33:59,427 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-2.cJordan [2022-03-20 03:33:59,431 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 03:33:59,431 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 03:33:59,485 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 03:33:59,491 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 03:33:59,492 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 03:33:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 03:33:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 03:33:59,508 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:33:59,508 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:33:59,509 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:33:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:33:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-03-20 03:33:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:33:59,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136720549] [2022-03-20 03:33:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:33:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:33:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:33:59,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:33:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:33:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:33:59,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:33:59,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136720549] [2022-03-20 03:33:59,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136720549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:33:59,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 03:33:59,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 03:33:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191520915] [2022-03-20 03:33:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:33:59,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 03:33:59,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:33:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 03:33:59,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 03:33:59,785 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:33:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:33:59,839 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-03-20 03:33:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 03:33:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-20 03:33:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:33:59,847 INFO L225 Difference]: With dead ends: 19 [2022-03-20 03:33:59,847 INFO L226 Difference]: Without dead ends: 13 [2022-03-20 03:33:59,849 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 03:33:59,855 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 03:33:59,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 03:33:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-03-20 03:33:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-03-20 03:33:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:33:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-03-20 03:33:59,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-03-20 03:33:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:33:59,884 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-03-20 03:33:59,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:33:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-03-20 03:33:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-20 03:33:59,886 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:33:59,886 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:33:59,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 03:33:59,887 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:33:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:33:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-03-20 03:33:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:33:59,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706647133] [2022-03-20 03:33:59,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:33:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:33:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:33:59,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:33:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:33:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:33:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:33:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706647133] [2022-03-20 03:33:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706647133] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 03:33:59,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 03:33:59,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 03:33:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958273781] [2022-03-20 03:33:59,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 03:34:00,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 03:34:00,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:34:00,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 03:34:00,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 03:34:00,001 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:34:00,033 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-03-20 03:34:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 03:34:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-20 03:34:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:34:00,034 INFO L225 Difference]: With dead ends: 15 [2022-03-20 03:34:00,034 INFO L226 Difference]: Without dead ends: 15 [2022-03-20 03:34:00,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 03:34:00,036 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 03:34:00,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 03:34:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-03-20 03:34:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-03-20 03:34:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-03-20 03:34:00,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-03-20 03:34:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:34:00,041 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-03-20 03:34:00,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-03-20 03:34:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-20 03:34:00,042 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:34:00,042 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:34:00,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 03:34:00,042 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:34:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:34:00,043 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-03-20 03:34:00,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:34:00,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844218253] [2022-03-20 03:34:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:34:00,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:34:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:34:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:34:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844218253] [2022-03-20 03:34:00,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844218253] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:34:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596395798] [2022-03-20 03:34:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:34:00,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:00,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:34:00,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 03:34:00,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-20 03:34:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:00,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 03:34:00,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:34:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:00,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:34:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596395798] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:34:00,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:34:00,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-20 03:34:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795497097] [2022-03-20 03:34:00,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:34:00,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 03:34:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:34:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 03:34:00,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-20 03:34:00,342 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:34:00,466 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-03-20 03:34:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 03:34:00,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-03-20 03:34:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:34:00,469 INFO L225 Difference]: With dead ends: 19 [2022-03-20 03:34:00,469 INFO L226 Difference]: Without dead ends: 19 [2022-03-20 03:34:00,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-20 03:34:00,475 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:34:00,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 03:34:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-03-20 03:34:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-03-20 03:34:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-03-20 03:34:00,479 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-03-20 03:34:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:34:00,479 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-03-20 03:34:00,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-03-20 03:34:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 03:34:00,480 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:34:00,480 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:34:00,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-20 03:34:00,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:00,681 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:34:00,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:34:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-03-20 03:34:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:34:00,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042447349] [2022-03-20 03:34:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:34:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:34:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:34:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:34:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042447349] [2022-03-20 03:34:00,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042447349] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:34:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111850829] [2022-03-20 03:34:00,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:34:00,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:34:00,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 03:34:00,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-20 03:34:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:00,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 03:34:00,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:34:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:01,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:34:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 03:34:01,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111850829] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:34:01,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:34:01,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-03-20 03:34:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465969969] [2022-03-20 03:34:01,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:34:01,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 03:34:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:34:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 03:34:01,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-03-20 03:34:01,105 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:34:01,277 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-03-20 03:34:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 03:34:01,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 03:34:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:34:01,278 INFO L225 Difference]: With dead ends: 26 [2022-03-20 03:34:01,278 INFO L226 Difference]: Without dead ends: 23 [2022-03-20 03:34:01,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-03-20 03:34:01,279 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:34:01,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 03:34:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-03-20 03:34:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-03-20 03:34:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-03-20 03:34:01,283 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-03-20 03:34:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:34:01,284 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-03-20 03:34:01,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-03-20 03:34:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 03:34:01,284 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:34:01,285 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:34:01,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-20 03:34:01,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-20 03:34:01,504 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:34:01,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:34:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1560917373, now seen corresponding path program 2 times [2022-03-20 03:34:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:34:01,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8954419] [2022-03-20 03:34:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:34:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:34:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:34:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:34:01,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8954419] [2022-03-20 03:34:01,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8954419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:34:01,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932888778] [2022-03-20 03:34:01,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 03:34:01,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:01,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:34:01,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 03:34:01,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-20 03:34:01,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 03:34:01,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:34:01,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 03:34:01,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:34:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:01,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:34:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:01,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932888778] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:34:01,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:34:01,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-03-20 03:34:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344767386] [2022-03-20 03:34:01,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:34:01,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 03:34:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:34:01,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 03:34:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-03-20 03:34:01,872 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:34:02,215 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-03-20 03:34:02,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 03:34:02,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 03:34:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:34:02,216 INFO L225 Difference]: With dead ends: 32 [2022-03-20 03:34:02,217 INFO L226 Difference]: Without dead ends: 32 [2022-03-20 03:34:02,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2022-03-20 03:34:02,218 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 03:34:02,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 03:34:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-20 03:34:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-20 03:34:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-03-20 03:34:02,222 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 19 [2022-03-20 03:34:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:34:02,222 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-03-20 03:34:02,222 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-03-20 03:34:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 03:34:02,223 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:34:02,223 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:34:02,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-20 03:34:02,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:02,436 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:34:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:34:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash 838082225, now seen corresponding path program 3 times [2022-03-20 03:34:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:34:02,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476581786] [2022-03-20 03:34:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:34:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:34:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:34:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:02,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:34:02,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476581786] [2022-03-20 03:34:02,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476581786] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:34:02,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48212995] [2022-03-20 03:34:02,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 03:34:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:34:02,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 03:34:02,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-20 03:34:02,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 03:34:02,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:34:02,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 03:34:02,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:34:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-20 03:34:02,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:34:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-20 03:34:02,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48212995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:34:02,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:34:02,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2022-03-20 03:34:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348570677] [2022-03-20 03:34:02,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:34:02,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 03:34:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:34:02,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 03:34:02,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-03-20 03:34:02,878 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:34:03,306 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-03-20 03:34:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 03:34:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-03-20 03:34:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:34:03,308 INFO L225 Difference]: With dead ends: 53 [2022-03-20 03:34:03,308 INFO L226 Difference]: Without dead ends: 53 [2022-03-20 03:34:03,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2022-03-20 03:34:03,309 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 03:34:03,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 33 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 03:34:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-20 03:34:03,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2022-03-20 03:34:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-03-20 03:34:03,314 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 31 [2022-03-20 03:34:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:34:03,314 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-03-20 03:34:03,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-03-20 03:34:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 03:34:03,316 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:34:03,316 INFO L499 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:34:03,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-20 03:34:03,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:03,519 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:34:03,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:34:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash 890325540, now seen corresponding path program 4 times [2022-03-20 03:34:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:34:03,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380777512] [2022-03-20 03:34:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:34:03,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:34:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:34:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-20 03:34:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:34:03,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380777512] [2022-03-20 03:34:03,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380777512] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:34:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776608115] [2022-03-20 03:34:03,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 03:34:03,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:03,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:34:03,732 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 03:34:03,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-20 03:34:03,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 03:34:03,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:34:03,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-20 03:34:03,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:34:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:04,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:34:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 03:34:04,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776608115] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:34:04,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:34:04,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 36 [2022-03-20 03:34:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823045412] [2022-03-20 03:34:04,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:34:04,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-20 03:34:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:34:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-20 03:34:04,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=907, Unknown=0, NotChecked=0, Total=1260 [2022-03-20 03:34:04,554 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:34:13,998 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-03-20 03:34:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-20 03:34:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-03-20 03:34:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:34:14,000 INFO L225 Difference]: With dead ends: 77 [2022-03-20 03:34:14,001 INFO L226 Difference]: Without dead ends: 77 [2022-03-20 03:34:14,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=876, Invalid=2430, Unknown=0, NotChecked=0, Total=3306 [2022-03-20 03:34:14,003 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 03:34:14,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 93 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 03:34:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-20 03:34:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2022-03-20 03:34:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-03-20 03:34:14,009 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 41 [2022-03-20 03:34:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:34:14,009 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-03-20 03:34:14,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:34:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-03-20 03:34:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-20 03:34:14,010 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:34:14,010 INFO L499 BasicCegarLoop]: trace histogram [23, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:34:14,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-20 03:34:14,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:14,224 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:34:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:34:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash -422126962, now seen corresponding path program 5 times [2022-03-20 03:34:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:34:14,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050327502] [2022-03-20 03:34:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:34:14,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:34:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:34:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:34:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 266 proven. 182 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-03-20 03:34:14,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:34:14,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050327502] [2022-03-20 03:34:14,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050327502] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:34:14,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668968953] [2022-03-20 03:34:14,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-20 03:34:14,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:34:14,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:34:14,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 03:34:14,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-20 03:34:15,390 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-03-20 03:34:15,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:34:15,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-20 03:34:15,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:34:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 03:34:15,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:34:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 03:34:16,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668968953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:34:16,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:34:16,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 21] total 41 [2022-03-20 03:34:16,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813385715] [2022-03-20 03:34:16,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:34:16,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-20 03:34:16,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:34:16,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-20 03:34:16,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1185, Unknown=0, NotChecked=0, Total=1640 [2022-03-20 03:34:16,718 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:35:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:35:00,011 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2022-03-20 03:35:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-20 03:35:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-03-20 03:35:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:35:00,013 INFO L225 Difference]: With dead ends: 98 [2022-03-20 03:35:00,013 INFO L226 Difference]: Without dead ends: 98 [2022-03-20 03:35:00,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=1475, Invalid=3927, Unknown=0, NotChecked=0, Total=5402 [2022-03-20 03:35:00,016 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 03:35:00,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 104 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 03:35:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-03-20 03:35:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-03-20 03:35:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:35:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-03-20 03:35:00,023 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 57 [2022-03-20 03:35:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:35:00,023 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-03-20 03:35:00,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:35:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-03-20 03:35:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-20 03:35:00,025 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:35:00,025 INFO L499 BasicCegarLoop]: trace histogram [43, 33, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:35:00,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 03:35:00,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:35:00,231 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:35:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:35:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash 505554918, now seen corresponding path program 6 times [2022-03-20 03:35:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:35:00,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673482457] [2022-03-20 03:35:00,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:35:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:35:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:35:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:35:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:35:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 646 proven. 1122 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-03-20 03:35:01,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:35:01,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673482457] [2022-03-20 03:35:01,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673482457] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:35:01,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236652542] [2022-03-20 03:35:01,073 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-20 03:35:01,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:35:01,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:35:01,076 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 03:35:01,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-20 03:35:03,899 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-03-20 03:35:03,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 03:35:03,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-20 03:35:03,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:35:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 693 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-03-20 03:35:04,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:35:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 693 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-03-20 03:35:06,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236652542] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:35:06,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:35:06,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13, 17] total 63 [2022-03-20 03:35:06,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349646455] [2022-03-20 03:35:06,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:35:06,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-20 03:35:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:35:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-20 03:35:06,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=2950, Unknown=0, NotChecked=0, Total=3906 [2022-03-20 03:35:06,393 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:36:24,955 WARN L232 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 03:36:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 03:36:25,043 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2022-03-20 03:36:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-20 03:36:25,043 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-03-20 03:36:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 03:36:25,045 INFO L225 Difference]: With dead ends: 176 [2022-03-20 03:36:25,045 INFO L226 Difference]: Without dead ends: 173 [2022-03-20 03:36:25,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 78.5s TimeCoverageRelationStatistics Valid=2927, Invalid=12323, Unknown=2, NotChecked=0, Total=15252 [2022-03-20 03:36:25,049 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 252 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-20 03:36:25,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 81 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-20 03:36:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-03-20 03:36:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2022-03-20 03:36:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 143 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:36:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-03-20 03:36:25,058 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 97 [2022-03-20 03:36:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 03:36:25,060 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-03-20 03:36:25,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 61 states have internal predecessors, (127), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:36:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-03-20 03:36:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-03-20 03:36:25,065 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 03:36:25,065 INFO L499 BasicCegarLoop]: trace histogram [57, 35, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 03:36:25,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 03:36:25,265 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:36:25,266 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 03:36:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 03:36:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1282419970, now seen corresponding path program 7 times [2022-03-20 03:36:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 03:36:25,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837450416] [2022-03-20 03:36:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 03:36:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 03:36:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:36:26,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 03:36:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:36:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1548 proven. 1260 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-03-20 03:36:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 03:36:26,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837450416] [2022-03-20 03:36:26,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837450416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 03:36:26,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469283389] [2022-03-20 03:36:26,064 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-20 03:36:26,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 03:36:26,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 03:36:26,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 03:36:26,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-20 03:36:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 03:36:26,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 114 conjunts are in the unsatisfiable core [2022-03-20 03:36:26,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 03:36:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 168 proven. 3080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 03:36:27,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 03:36:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 168 proven. 3080 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 03:36:33,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469283389] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 03:36:33,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 03:36:33,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 58, 59] total 117 [2022-03-20 03:36:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725473535] [2022-03-20 03:36:33,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 03:36:33,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-03-20 03:36:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 03:36:33,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-03-20 03:36:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3517, Invalid=10055, Unknown=0, NotChecked=0, Total=13572 [2022-03-20 03:36:33,810 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 117 states, 117 states have (on average 2.034188034188034) internal successors, (238), 116 states have internal predecessors, (238), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 03:36:38,241 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse13 65521) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65521))) (let ((.cse15 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse21 65521) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 65521) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65521))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse28 65521) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65521))) (let ((.cse30 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65521))) (let ((.cse35 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse35 65521) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse41 65521) (not (< .cse41 268435455)))) (let ((.cse42 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse42 268435455)) (< .cse42 65521))) (let ((.cse43 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse43 65521) (not (< .cse43 268435455)))) (let ((.cse44 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse44 268435455)) (< .cse44 65521))) (let ((.cse45 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse46 65521) (not (< .cse46 268435455)))) (let ((.cse47 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (let ((.cse48 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse48 65521) (not (< .cse48 268435455)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse49 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse49 268435455)) (< .cse49 65521))) (let ((.cse50 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse50 65521) (not (< .cse50 268435455)))) (let ((.cse51 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse51 268435455)) (< .cse51 65521))) (let ((.cse52 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse52 268435455)) (< .cse52 65521))) (let ((.cse53 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse53 268435455)) (< .cse53 65521))) (let ((.cse54 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse54 65521) (not (< .cse54 268435455))))) is different from false [2022-03-20 03:39:54,599 WARN L232 SmtUtils]: Spent 1.28m on a formula simplification. DAG size of input: 392 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 03:39:56,635 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse13 65521) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65521))) (let ((.cse15 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse21 65521) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 65521) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65521))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse28 65521) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65521))) (let ((.cse30 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65521))) (let ((.cse35 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse35 65521) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse41 268435455)) (< .cse41 65521))) (let ((.cse42 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse42 65521) (not (< .cse42 268435455)))) (let ((.cse43 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse43 268435455)) (< .cse43 65521))) (let ((.cse44 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse44 65521) (not (< .cse44 268435455)))) (let ((.cse45 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse46 65521) (not (< .cse46 268435455)))) (let ((.cse47 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse48 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse48 268435455)) (< .cse48 65521))) (let ((.cse49 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse49 65521) (not (< .cse49 268435455)))) (let ((.cse50 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse50 268435455)) (< .cse50 65521))) (let ((.cse51 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse51 268435455)) (< .cse51 65521))) (let ((.cse52 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse52 268435455)) (< .cse52 65521))) (let ((.cse53 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse53 65521) (not (< .cse53 268435455))))) is different from false [2022-03-20 03:39:58,650 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse0 268435455)) (< .cse0 65521))) (let ((.cse1 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse1 65521) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse2 65521) (not (< .cse2 268435455)))) (let ((.cse3 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65521))) (let ((.cse4 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65521))) (let ((.cse5 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65521))) (let ((.cse6 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65521))) (let ((.cse7 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse7 65521) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse8 65521) (not (< .cse8 268435455)))) (< (mod c_main_~x~0 4294967296) 65521) (let ((.cse9 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (< .cse9 268435455)) (< .cse9 65521))) (let ((.cse10 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< .cse10 65521) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse11 65521) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65521))) (let ((.cse13 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse13 65521) (not (< .cse13 268435455)))) (let ((.cse14 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65521))) (let ((.cse15 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< .cse15 65521) (not (< .cse15 268435455)))) (let ((.cse16 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< .cse16 65521) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 65521) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse18 65521) (not (< .cse18 268435455)))) (let ((.cse19 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65521))) (let ((.cse20 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse20 65521) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse21 65521) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65521))) (let ((.cse23 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65521))) (let ((.cse24 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< .cse24 65521) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse25 65521) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 65521) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65521))) (let ((.cse28 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< .cse28 65521) (not (< .cse28 268435455)))) (let ((.cse29 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65521))) (let ((.cse30 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse30 65521) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65521))) (let ((.cse32 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65521))) (let ((.cse33 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65521))) (let ((.cse34 (mod (+ 52 c_main_~x~0) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65521))) (let ((.cse35 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< .cse35 65521) (not (< .cse35 268435455)))) (let ((.cse36 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65521))) (let ((.cse37 (mod (+ c_main_~x~0 54) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65521))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse38 65521) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ 57 c_main_~x~0) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65521))) (let ((.cse40 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< .cse40 65521) (not (< .cse40 268435455)))) (let ((.cse41 (mod (+ 10 c_main_~x~0) 4294967296))) (or (not (< .cse41 268435455)) (< .cse41 65521))) (let ((.cse42 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse42 65521) (not (< .cse42 268435455)))) (let ((.cse43 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse43 268435455)) (< .cse43 65521))) (let ((.cse44 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< .cse44 65521) (not (< .cse44 268435455)))) (let ((.cse45 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse45 65521) (not (< .cse45 268435455)))) (let ((.cse46 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse46 65521) (not (< .cse46 268435455)))) (let ((.cse47 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse47 65521) (not (< .cse47 268435455)))) (let ((.cse48 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse48 268435455)) (< .cse48 65521))) (let ((.cse49 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse49 65521) (not (< .cse49 268435455)))) (let ((.cse50 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse50 268435455)) (< .cse50 65521))) (let ((.cse51 (mod (+ 8 c_main_~x~0) 4294967296))) (or (not (< .cse51 268435455)) (< .cse51 65521))) (let ((.cse52 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse52 268435455)) (< .cse52 65521))) (let ((.cse53 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse53 65521) (not (< .cse53 268435455))))) is different from false [2022-03-20 03:42:04,133 WARN L232 SmtUtils]: Spent 31.58s on a formula simplification. DAG size of input: 243 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 03:44:10,046 WARN L232 SmtUtils]: Spent 46.55s on a formula simplification. DAG size of input: 249 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 03:46:49,763 WARN L232 SmtUtils]: Spent 1.22m on a formula simplification. DAG size of input: 377 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)