./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca7b092571e2aaa668ed3cc711eaa0aa2bd05b3934760ddf140f8cffb6c5d917 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:54:25,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:54:25,180 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:54:25,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:54:25,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:54:25,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:54:25,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:54:25,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:54:25,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:54:25,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:54:25,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:54:25,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:54:25,238 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:54:25,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:54:25,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:54:25,241 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:54:25,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:54:25,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:54:25,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:54:25,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:54:25,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:54:25,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:54:25,244 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:54:25,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:54:25,245 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:54:25,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:54:25,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:54:25,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:54:25,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:25,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:54:25,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:54:25,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:54:25,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:54:25,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:54:25,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:54:25,251 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:54:25,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:54:25,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:54:25,252 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:54:25,253 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca7b092571e2aaa668ed3cc711eaa0aa2bd05b3934760ddf140f8cffb6c5d917 [2023-11-06 21:54:25,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:54:25,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:54:25,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:54:25,650 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:54:25,651 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:54:25,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i [2023-11-06 21:54:28,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:54:29,029 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:54:29,030 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i [2023-11-06 21:54:29,043 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/data/daed378b2/016477d87e5840d69e63d6e9ce290048/FLAG5f1f49f15 [2023-11-06 21:54:29,069 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/data/daed378b2/016477d87e5840d69e63d6e9ce290048 [2023-11-06 21:54:29,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:54:29,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:54:29,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:29,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:54:29,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:54:29,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da073c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29, skipping insertion in model container [2023-11-06 21:54:29,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,138 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:54:29,334 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i[916,929] [2023-11-06 21:54:29,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:29,401 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:54:29,414 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-38.i[916,929] [2023-11-06 21:54:29,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:29,455 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:54:29,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29 WrapperNode [2023-11-06 21:54:29,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:29,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:29,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:54:29,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:54:29,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,541 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-11-06 21:54:29,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:29,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:54:29,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:54:29,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:54:29,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:54:29,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:54:29,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:54:29,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:54:29,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (1/1) ... [2023-11-06 21:54:29,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:29,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:54:29,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:54:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:54:29,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:54:29,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:54:29,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:54:29,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:54:29,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:54:29,806 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:54:29,811 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:54:30,212 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:54:30,220 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:54:30,220 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:54:30,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:30 BoogieIcfgContainer [2023-11-06 21:54:30,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:54:30,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:54:30,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:54:30,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:54:30,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:54:29" (1/3) ... [2023-11-06 21:54:30,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121ccacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:30, skipping insertion in model container [2023-11-06 21:54:30,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:29" (2/3) ... [2023-11-06 21:54:30,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121ccacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:30, skipping insertion in model container [2023-11-06 21:54:30,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:30" (3/3) ... [2023-11-06 21:54:30,256 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-38.i [2023-11-06 21:54:30,295 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:54:30,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:54:30,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:54:30,364 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@676751fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:54:30,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:54:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:54:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-06 21:54:30,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:30,394 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:30,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:30,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1753168494, now seen corresponding path program 1 times [2023-11-06 21:54:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:30,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839064641] [2023-11-06 21:54:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:54:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:54:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:54:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:54:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:54:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:54:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:54:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:54:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:54:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:54:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:54:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:54:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:54:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:54:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:54:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:54:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:54:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:54:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:54:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:54:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 21:54:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 21:54:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:54:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839064641] [2023-11-06 21:54:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839064641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:31,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:31,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:31,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512697216] [2023-11-06 21:54:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:31,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:54:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:31,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:54:31,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:54:31,137 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-06 21:54:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:31,178 INFO L93 Difference]: Finished difference Result 127 states and 224 transitions. [2023-11-06 21:54:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:54:31,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 168 [2023-11-06 21:54:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:31,190 INFO L225 Difference]: With dead ends: 127 [2023-11-06 21:54:31,190 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 21:54:31,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:54:31,200 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:31,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:54:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 21:54:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-06 21:54:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 21:54:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2023-11-06 21:54:31,251 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 168 [2023-11-06 21:54:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:31,252 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2023-11-06 21:54:31,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-06 21:54:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2023-11-06 21:54:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-06 21:54:31,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:31,259 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:31,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:54:31,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:31,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2025210478, now seen corresponding path program 1 times [2023-11-06 21:54:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838650461] [2023-11-06 21:54:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:31,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:54:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:54:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:54:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:54:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:54:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:54:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:54:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:54:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:54:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:54:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:54:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:54:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:54:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:54:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:54:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:54:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:54:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:54:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:54:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:54:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 21:54:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 21:54:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:54:31,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:31,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838650461] [2023-11-06 21:54:31,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838650461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:31,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:31,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:31,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686956274] [2023-11-06 21:54:31,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:31,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:31,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:31,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:31,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:31,764 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:31,843 INFO L93 Difference]: Finished difference Result 161 states and 239 transitions. [2023-11-06 21:54:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:31,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2023-11-06 21:54:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:31,850 INFO L225 Difference]: With dead ends: 161 [2023-11-06 21:54:31,853 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 21:54:31,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:31,858 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:31,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 174 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:54:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 21:54:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2023-11-06 21:54:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:54:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2023-11-06 21:54:31,913 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 168 [2023-11-06 21:54:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:31,914 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2023-11-06 21:54:31,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2023-11-06 21:54:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-06 21:54:31,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:31,925 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:31,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:54:31,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:31,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2027057520, now seen corresponding path program 1 times [2023-11-06 21:54:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:31,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100588357] [2023-11-06 21:54:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:54:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:54:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:54:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:54:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:54:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:54:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:54:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:54:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:54:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:54:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:54:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:54:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:54:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:54:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:54:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:54:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:54:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:54:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:54:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:54:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 21:54:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 21:54:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:54:38,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:38,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100588357] [2023-11-06 21:54:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100588357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:38,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:38,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:54:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933390171] [2023-11-06 21:54:38,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:38,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:38,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:38,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:38,789 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:42,943 INFO L93 Difference]: Finished difference Result 195 states and 281 transitions. [2023-11-06 21:54:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:54:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2023-11-06 21:54:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:42,950 INFO L225 Difference]: With dead ends: 195 [2023-11-06 21:54:42,950 INFO L226 Difference]: Without dead ends: 193 [2023-11-06 21:54:42,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:54:42,953 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 72 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:42,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 940 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:54:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-06 21:54:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 105. [2023-11-06 21:54:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 59 states have internal predecessors, (65), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:54:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-11-06 21:54:43,001 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 168 [2023-11-06 21:54:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:43,002 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-11-06 21:54:43,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-11-06 21:54:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-06 21:54:43,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:43,006 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:43,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:54:43,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:43,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:43,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1587851406, now seen corresponding path program 1 times [2023-11-06 21:54:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:43,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338326657] [2023-11-06 21:54:43,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:43,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:54:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:54:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:54:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:54:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:54:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:54:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:54:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:54:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:54:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:54:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:54:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:54:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:54:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:54:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:54:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:54:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:54:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:54:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:54:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:54:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:54:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 21:54:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 21:54:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:54:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338326657] [2023-11-06 21:54:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338326657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:49,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:49,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:54:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596204908] [2023-11-06 21:54:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:49,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:54:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:49,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:54:49,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:49,014 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:52,442 INFO L93 Difference]: Finished difference Result 201 states and 287 transitions. [2023-11-06 21:54:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:54:52,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2023-11-06 21:54:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:52,448 INFO L225 Difference]: With dead ends: 201 [2023-11-06 21:54:52,449 INFO L226 Difference]: Without dead ends: 199 [2023-11-06 21:54:52,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:54:52,451 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 71 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:52,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 894 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 21:54:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-06 21:54:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 103. [2023-11-06 21:54:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:54:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-11-06 21:54:52,495 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 168 [2023-11-06 21:54:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:52,496 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-11-06 21:54:52,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:54:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-11-06 21:54:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 21:54:52,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:52,499 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:52,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:54:52,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:52,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1797022649, now seen corresponding path program 1 times [2023-11-06 21:54:52,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:52,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219926533] [2023-11-06 21:54:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:52,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:55:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:55:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:55:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:55:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:55:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:55:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:55:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:55:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:55:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:55:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:55:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:55:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:55:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:55:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:55:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:55:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:55:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:55:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:55:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:55:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:55:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:55:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 21:55:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 21:55:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:55:04,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:04,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219926533] [2023-11-06 21:55:04,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219926533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:04,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:04,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:55:04,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423498457] [2023-11-06 21:55:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:04,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:55:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:04,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:55:04,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:04,241 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:55:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:09,442 INFO L93 Difference]: Finished difference Result 295 states and 428 transitions. [2023-11-06 21:55:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 21:55:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2023-11-06 21:55:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:09,446 INFO L225 Difference]: With dead ends: 295 [2023-11-06 21:55:09,446 INFO L226 Difference]: Without dead ends: 195 [2023-11-06 21:55:09,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2023-11-06 21:55:09,451 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 89 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:09,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 858 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 21:55:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-06 21:55:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 111. [2023-11-06 21:55:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.125) internal successors, (72), 65 states have internal predecessors, (72), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:55:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2023-11-06 21:55:09,498 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 169 [2023-11-06 21:55:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:09,499 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2023-11-06 21:55:09,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:55:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2023-11-06 21:55:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 21:55:09,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:09,502 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:09,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:55:09,503 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:09,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1795175607, now seen corresponding path program 1 times [2023-11-06 21:55:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054955911] [2023-11-06 21:55:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:55:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:55:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:55:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:55:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:55:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:55:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:55:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:55:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:55:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:55:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:55:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:55:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:55:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:55:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:55:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:55:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:55:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:55:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:55:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:55:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:55:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:55:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 21:55:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 21:55:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:55:28,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054955911] [2023-11-06 21:55:28,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054955911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:28,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:28,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:55:28,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077474392] [2023-11-06 21:55:28,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:28,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:55:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:55:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:55:28,802 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:55:30,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:55:38,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:55:42,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:55:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:43,054 INFO L93 Difference]: Finished difference Result 195 states and 278 transitions. [2023-11-06 21:55:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 21:55:43,055 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2023-11-06 21:55:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:43,059 INFO L225 Difference]: With dead ends: 195 [2023-11-06 21:55:43,059 INFO L226 Difference]: Without dead ends: 193 [2023-11-06 21:55:43,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2023-11-06 21:55:43,061 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 88 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:43,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 856 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2023-11-06 21:55:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-06 21:55:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 111. [2023-11-06 21:55:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.125) internal successors, (72), 65 states have internal predecessors, (72), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:55:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2023-11-06 21:55:43,116 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 169 [2023-11-06 21:55:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:43,121 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2023-11-06 21:55:43,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:55:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2023-11-06 21:55:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 21:55:43,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:43,125 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:43,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:55:43,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:43,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2104917637, now seen corresponding path program 1 times [2023-11-06 21:55:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:43,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589878507] [2023-11-06 21:55:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:55:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:55:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:55:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:55:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:55:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:55:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:55:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:55:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:55:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:55:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:55:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:55:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:55:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:55:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:55:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:55:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:55:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:55:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:55:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:55:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:55:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:55:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:55:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 21:55:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 21:55:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:55:49,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:49,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589878507] [2023-11-06 21:55:49,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589878507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:49,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:49,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:55:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921906196] [2023-11-06 21:55:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:49,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:55:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:49,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:55:49,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:55:49,894 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:55:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:54,278 INFO L93 Difference]: Finished difference Result 285 states and 417 transitions. [2023-11-06 21:55:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 21:55:54,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2023-11-06 21:55:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:54,284 INFO L225 Difference]: With dead ends: 285 [2023-11-06 21:55:54,284 INFO L226 Difference]: Without dead ends: 177 [2023-11-06 21:55:54,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:55:54,286 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 59 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:54,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 852 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 21:55:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-06 21:55:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 106. [2023-11-06 21:55:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 60 states have internal predecessors, (65), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:55:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2023-11-06 21:55:54,336 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 169 [2023-11-06 21:55:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:54,337 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2023-11-06 21:55:54,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:55:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2023-11-06 21:55:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 21:55:54,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:54,340 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:54,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:55:54,341 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:54,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2106764679, now seen corresponding path program 1 times [2023-11-06 21:55:54,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690624041] [2023-11-06 21:55:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:56:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:56:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 21:56:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 21:56:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:56:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 21:56:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 21:56:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 21:56:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 21:56:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 21:56:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:56:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:56:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 21:56:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 21:56:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 21:56:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:56:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:56:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:56:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:56:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 21:56:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 21:56:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 21:56:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:56:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:56:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 21:56:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 21:56:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 21:56:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-06 21:56:05,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690624041] [2023-11-06 21:56:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690624041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:05,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:05,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:56:05,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164106888] [2023-11-06 21:56:05,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:05,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:56:05,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:05,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:56:05,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:56:05,249 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:56:08,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 21:56:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:12,436 INFO L93 Difference]: Finished difference Result 173 states and 253 transitions. [2023-11-06 21:56:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 21:56:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 169 [2023-11-06 21:56:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:12,439 INFO L225 Difference]: With dead ends: 173 [2023-11-06 21:56:12,439 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 21:56:12,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:56:12,441 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 42 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:12,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 728 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2023-11-06 21:56:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 21:56:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 21:56:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 21:56:12,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2023-11-06 21:56:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:12,443 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 21:56:12,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-06 21:56:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 21:56:12,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 21:56:12,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:56:12,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:56:12,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 21:56:18,837 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-06 21:56:18,837 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-06 21:56:18,837 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 62) no Hoare annotation was computed. [2023-11-06 21:56:18,837 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-06 21:56:18,837 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 21:56:18,837 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 21:56:18,838 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse25 (div ~var_1_3~0 65536)) (.cse22 (div ~var_1_2~0 65536))) (let ((.cse23 (div ~var_1_4~0 65536)) (.cse15 (* 65536 .cse22)) (.cse28 (* .cse25 65536)) (.cse21 (div ~var_1_1~0 65536)) (.cse3 (* ~var_1_4~0 65535))) (let ((.cse2 (div (+ .cse3 ~var_1_3~0) 65536)) (.cse4 (* .cse21 65536)) (.cse24 (div (+ .cse3 ~var_1_2~0) 65536)) (.cse1 (+ .cse28 ~var_1_2~0)) (.cse0 (+ .cse15 ~var_1_3~0)) (.cse14 (* .cse23 65536)) (.cse17 (+ .cse28 ~var_1_4~0 ~var_1_1~0))) (let ((.cse5 (<= (+ .cse14 ~var_1_3~0) .cse17)) (.cse9 (<= .cse1 .cse0)) (.cse6 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (.cse10 (= (+ ~var_1_9~0 ~var_1_8~0 ~var_1_11~0 ~var_1_10~0) ~var_1_7~0)) (.cse8 (+ (* .cse24 65536) ~var_1_1~0)) (.cse7 (+ .cse3 ~var_1_2~0 .cse4)) (.cse12 (or (< (+ .cse15 ~var_1_4~0) (+ .cse14 ~var_1_2~0 1)) (let ((.cse26 (* 4294967295 ~var_1_3~0)) (.cse27 (* 4294967295 ~var_1_2~0))) (= (+ (* (div (+ (* (- 281474976645120) .cse25) 2144048120 .cse26 (* (- 281474976645120) .cse22) .cse27 ~var_1_6~0) 4294967296) 4294967296) (* .cse22 281474976645120) (* .cse25 281474976645120) ~var_1_5~0) (+ (* (div ~var_1_5~0 4294967296) 4294967296) 2144048120 .cse26 .cse27 ~var_1_6~0))))) (.cse13 (or (< (+ .cse21 .cse22 ~var_1_4~0) (+ .cse23 .cse24 1)) (< (+ .cse25 .cse21 ~var_1_4~0) (+ .cse23 .cse2 1)))) (.cse11 (+ .cse15 ~var_1_3~0 1))) (or (and (or (< .cse0 .cse1) (< (+ (* 65536 .cse2) ~var_1_1~0) (+ .cse3 ~var_1_3~0 .cse4 1))) (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0) .cse5 .cse6 (or (<= .cse7 .cse8) .cse9) .cse10 (or (< .cse1 .cse11) (< .cse8 (+ .cse3 ~var_1_2~0 .cse4 1))) .cse12 .cse13) (let ((.cse16 (<= .cse11 .cse1)) (.cse19 (* 65536 (div ~var_1_12~0 65536))) (.cse18 (* (div ~var_1_14~0 65536) 65536))) (and (or (and .cse5 .cse9) (and (<= (+ .cse14 ~var_1_2~0) (+ .cse15 ~var_1_4~0 ~var_1_1~0)) .cse16)) .cse6 .cse10 (or (< .cse17 (+ .cse14 ~var_1_3~0 1)) (and (<= .cse8 .cse7) .cse16)) (or (< (+ 16842 .cse18) ~var_1_14~0) (= (+ 1103833641 .cse19 ~var_1_16~0) (+ ~var_1_12~0 (* 65536 (div (+ 1103833641 ~var_1_16~0) 65536))))) (or (let ((.cse20 (* ~var_1_14~0 65535))) (= (+ (* 65536 (div (+ .cse20 ~var_1_16~0 27636) 65536)) ~var_1_12~0) (+ .cse20 .cse19 ~var_1_16~0 27636))) (< ~var_1_14~0 (+ 16843 .cse18))) .cse12 .cse13))))))) [2023-11-06 21:56:18,839 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 114 125) the Hoare annotation is: false [2023-11-06 21:56:18,839 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-11-06 21:56:18,839 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-11-06 21:56:18,839 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-11-06 21:56:18,839 INFO L902 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: true [2023-11-06 21:56:18,839 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-06 21:56:18,839 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 21:56:18,840 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-06 21:56:18,840 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 50 58) no Hoare annotation was computed. [2023-11-06 21:56:18,840 INFO L902 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: true [2023-11-06 21:56:18,840 INFO L902 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: true [2023-11-06 21:56:18,840 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2023-11-06 21:56:18,840 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-06 21:56:18,840 INFO L902 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: true [2023-11-06 21:56:18,841 INFO L902 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: true [2023-11-06 21:56:18,841 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-06 21:56:18,841 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2023-11-06 21:56:18,841 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 46 48) no Hoare annotation was computed. [2023-11-06 21:56:18,841 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 21:56:18,841 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-11-06 21:56:18,842 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-11-06 21:56:18,842 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-06 21:56:18,842 INFO L902 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: true [2023-11-06 21:56:18,842 INFO L902 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: true [2023-11-06 21:56:18,842 INFO L902 garLoopResultBuilder]: At program point L105-1(line 105) the Hoare annotation is: true [2023-11-06 21:56:18,842 INFO L902 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: true [2023-11-06 21:56:18,842 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-06 21:56:18,843 INFO L902 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: true [2023-11-06 21:56:18,843 INFO L902 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: true [2023-11-06 21:56:18,843 INFO L899 garLoopResultBuilder]: For program point L106(lines 64 107) no Hoare annotation was computed. [2023-11-06 21:56:18,843 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-11-06 21:56:18,843 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 21:56:18,843 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-06 21:56:18,844 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-06 21:56:18,844 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 21:56:18,844 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-06 21:56:18,845 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 110 113) the Hoare annotation is: (let ((.cse32 (div ~var_1_2~0 65536)) (.cse35 (div ~var_1_3~0 65536))) (let ((.cse33 (div ~var_1_4~0 65536)) (.cse44 (* .cse35 65536)) (.cse31 (div ~var_1_1~0 65536)) (.cse47 (* ~var_1_4~0 65535)) (.cse23 (* 65536 .cse32))) (let ((.cse49 (+ .cse23 ~var_1_3~0)) (.cse34 (div (+ .cse47 ~var_1_2~0) 65536)) (.cse48 (* .cse31 65536)) (.cse39 (* 4294967295 ~var_1_3~0)) (.cse40 (* 4294967295 ~var_1_2~0)) (.cse46 (+ .cse23 ~var_1_3~0 1)) (.cse45 (+ .cse44 ~var_1_2~0)) (.cse19 (div ~var_1_14~0 65536)) (.cse29 (* .cse33 65536))) (let ((.cse5 (+ .cse23 ~var_1_4~0)) (.cse30 (+ .cse29 ~var_1_2~0 1)) (.cse9 (* ~var_1_14~0 65535)) (.cse41 (* .cse19 65536)) (.cse10 (* 65536 (div ~var_1_12~0 65536))) (.cse18 (div ~var_1_17~0 65536)) (.cse17 (div (+ ~var_1_15~0 ~var_1_14~0) 65536)) (.cse28 (<= .cse46 .cse45)) (.cse37 (div (+ (* (- 281474976645120) .cse35) 2144048120 .cse39 (* (- 281474976645120) .cse32) .cse40 ~var_1_6~0) 4294967296)) (.cse38 (div ~var_1_5~0 4294967296)) (.cse24 (+ .cse29 ~var_1_3~0)) (.cse25 (+ .cse44 ~var_1_4~0 ~var_1_1~0)) (.cse3 (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0)) (.cse43 (+ .cse47 ~var_1_2~0 .cse48)) (.cse42 (+ (* .cse34 65536) ~var_1_1~0)) (.cse27 (<= .cse45 .cse49)) (.cse36 (div (+ .cse47 ~var_1_3~0) 65536))) (let ((.cse0 (or (< .cse49 .cse45) (< (+ (* 65536 .cse36) ~var_1_1~0) (+ .cse47 ~var_1_3~0 .cse48 1)))) (.cse11 (or (<= .cse43 .cse42) .cse27)) (.cse13 (or (< .cse45 .cse46) (< .cse42 (+ .cse47 ~var_1_2~0 .cse48 1)))) (.cse16 (not .cse3)) (.cse4 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse1 (<= .cse24 .cse25)) (.cse6 (+ .cse29 ~var_1_2~0)) (.cse8 (+ ~var_1_3~0 ~var_1_2~0 .cse38)) (.cse7 (+ .cse37 .cse44 .cse23)) (.cse12 (= (+ ~var_1_9~0 ~var_1_8~0 ~var_1_11~0 ~var_1_10~0) ~var_1_7~0)) (.cse26 (and (<= .cse42 .cse43) .cse28)) (.cse20 (= (+ (* .cse18 65536) ~var_1_15~0 ~var_1_14~0) (+ (* 65536 .cse17) ~var_1_17~0))) (.cse21 (or (< (+ 16842 .cse41) ~var_1_14~0) (= (+ 1103833641 .cse10 ~var_1_16~0) (+ ~var_1_12~0 (* 65536 (div (+ 1103833641 ~var_1_16~0) 65536)))))) (.cse22 (or (= (+ (* 65536 (div (+ .cse9 ~var_1_16~0 27636) 65536)) ~var_1_12~0) (+ .cse9 .cse10 ~var_1_16~0 27636)) (< ~var_1_14~0 (+ 16843 .cse41)))) (.cse14 (or (< .cse5 .cse30) (= (+ (* .cse37 4294967296) (* .cse32 281474976645120) (* .cse35 281474976645120) ~var_1_5~0) (+ (* .cse38 4294967296) 2144048120 .cse39 .cse40 ~var_1_6~0)))) (.cse15 (or (< (+ .cse31 .cse32 ~var_1_4~0) (+ .cse33 .cse34 1)) (< (+ .cse35 .cse31 ~var_1_4~0) (+ .cse33 .cse36 1))))) (or (and .cse0 .cse1 (let ((.cse2 (= (+ .cse9 .cse10 ~var_1_3~0 ~var_1_15~0) (+ (* 65536 (div (+ .cse9 ~var_1_3~0 ~var_1_15~0) 65536)) ~var_1_12~0)))) (or (and .cse2 .cse3 .cse4 (<= .cse5 .cse6)) (and .cse2 .cse3 .cse4 (<= .cse7 .cse8)))) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse4 .cse11 (<= .cse17 (+ .cse18 .cse19 (div ~var_1_15~0 65536))) .cse12 .cse20 .cse13 .cse21 .cse22 .cse14 .cse15) (and (or (= ~var_1_19~0 (* 256 (div ~var_1_19~0 256))) (= (* (div ~var_1_18~0 256) 256) ~var_1_18~0)) .cse16 .cse4 (< .cse6 (+ .cse23 ~var_1_4~0 ~var_1_1~0 1)) .cse12 (or (= .cse24 .cse25) .cse26) .cse21 .cse22 .cse14 .cse15) (and .cse16 .cse4 (or (and .cse1 .cse27) (and (<= .cse6 (+ .cse23 ~var_1_4~0 ~var_1_1~0)) .cse28)) (= .cse8 .cse7) .cse12 (or (< .cse25 (+ .cse29 ~var_1_3~0 1)) .cse26) .cse20 .cse21 .cse22 (<= .cse30 .cse5) .cse14 .cse15))))))) [2023-11-06 21:56:18,845 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 42) no Hoare annotation was computed. [2023-11-06 21:56:18,845 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-11-06 21:56:18,845 INFO L902 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: true [2023-11-06 21:56:18,845 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-11-06 21:56:18,846 INFO L902 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: true [2023-11-06 21:56:18,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 21:56:18,846 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-06 21:56:18,846 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 58) no Hoare annotation was computed. [2023-11-06 21:56:18,846 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 109) no Hoare annotation was computed. [2023-11-06 21:56:18,846 INFO L902 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: true [2023-11-06 21:56:18,847 INFO L902 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: true [2023-11-06 21:56:18,847 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-06 21:56:18,847 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-06 21:56:18,847 INFO L902 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: true [2023-11-06 21:56:18,847 INFO L902 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: true [2023-11-06 21:56:18,848 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (or (let ((.cse11 (div ~var_1_3~0 65536))) (let ((.cse16 (* .cse11 65536)) (.cse13 (div ~var_1_2~0 65536))) (let ((.cse6 (* ~var_1_4~0 65535)) (.cse15 (div ~var_1_4~0 65536)) (.cse3 (* 65536 .cse13)) (.cse2 (+ .cse16 ~var_1_2~0))) (let ((.cse1 (+ .cse16 ~var_1_4~0 ~var_1_1~0)) (.cse4 (<= (+ .cse3 ~var_1_3~0 1) .cse2)) (.cse9 (* 65536 (div ~var_1_12~0 65536))) (.cse8 (* (div ~var_1_14~0 65536) 65536)) (.cse0 (* .cse15 65536)) (.cse5 (div (+ .cse6 ~var_1_2~0) 65536)) (.cse7 (div ~var_1_1~0 65536))) (and (or (and (<= (+ .cse0 ~var_1_3~0) .cse1) (<= .cse2 (+ .cse3 ~var_1_3~0))) (and (<= (+ .cse0 ~var_1_2~0) (+ .cse3 ~var_1_4~0 ~var_1_1~0)) .cse4)) (= (+ ~var_1_9~0 ~var_1_8~0 ~var_1_11~0 ~var_1_10~0) ~var_1_7~0) (or (< .cse1 (+ .cse0 ~var_1_3~0 1)) (and (<= (+ (* .cse5 65536) ~var_1_1~0) (+ .cse6 ~var_1_2~0 (* .cse7 65536))) .cse4)) (or (< (+ 16842 .cse8) ~var_1_14~0) (= (+ 1103833641 .cse9 ~var_1_16~0) (+ ~var_1_12~0 (* 65536 (div (+ 1103833641 ~var_1_16~0) 65536))))) (or (let ((.cse10 (* ~var_1_14~0 65535))) (= (+ (* 65536 (div (+ .cse10 ~var_1_16~0 27636) 65536)) ~var_1_12~0) (+ .cse10 .cse9 ~var_1_16~0 27636))) (< ~var_1_14~0 (+ 16843 .cse8))) (or (< (+ .cse3 ~var_1_4~0) (+ .cse0 ~var_1_2~0 1)) (let ((.cse12 (* 4294967295 ~var_1_3~0)) (.cse14 (* 4294967295 ~var_1_2~0))) (= (+ (* (div (+ (* (- 281474976645120) .cse11) 2144048120 .cse12 (* (- 281474976645120) .cse13) .cse14 ~var_1_6~0) 4294967296) 4294967296) (* .cse13 281474976645120) (* .cse11 281474976645120) ~var_1_5~0) (+ (* (div ~var_1_5~0 4294967296) 4294967296) 2144048120 .cse12 .cse14 ~var_1_6~0)))) (or (< (+ .cse7 .cse13 ~var_1_4~0) (+ .cse15 .cse5 1)) (< (+ .cse11 .cse7 ~var_1_4~0) (+ .cse15 (div (+ .cse6 ~var_1_3~0) 65536) 1)))))))) (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0)) [2023-11-06 21:56:18,848 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-06 21:56:18,848 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-06 21:56:18,848 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 63) no Hoare annotation was computed. [2023-11-06 21:56:18,848 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 21:56:18,849 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 21:56:18,849 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 21:56:18,849 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 21:56:18,852 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:18,855 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:56:18,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:56:18 BoogieIcfgContainer [2023-11-06 21:56:18,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:56:18,916 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:56:18,916 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:56:18,916 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:56:18,917 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:30" (3/4) ... [2023-11-06 21:56:18,919 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 21:56:18,924 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 21:56:18,931 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 21:56:18,932 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 21:56:18,932 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 21:56:18,933 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 21:56:18,964 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((65536 * (var_1_2 / 65536)) + var_1_3) < (((var_1_3 / 65536) * 65536) + var_1_2)) || (((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) + 1))) && ((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1))) && (((((((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_3) + var_1_15) == ((65536 * ((((var_1_14 * 65535) + var_1_3) + var_1_15) / 65536)) + var_1_12)) && (((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && (((65536 * (var_1_2 / 65536)) + var_1_4) <= (((var_1_4 / 65536) * 65536) + var_1_2))) || ((((((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_3) + var_1_15) == ((65536 * ((((var_1_14 * 65535) + var_1_3) + var_1_15) / 65536)) + var_1_12)) && (((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && ((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) + ((var_1_3 / 65536) * 65536)) + (65536 * (var_1_2 / 65536))) <= ((var_1_3 + var_1_2) + (var_1_5 / 4294967296)))))) && (((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) <= (((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) || ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3)))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_3 / 65536) * 65536) + var_1_2) < (((65536 * (var_1_2 / 65536)) + var_1_3) + 1)) || ((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) + 1)))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1)))) || ((((((((((((!((((var_1_13 / 256) * 256) == var_1_13)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) < (((var_1_3 / 65536) * 65536) + var_1_2)) || (((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) + 1)))) && ((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1))) && !((\result == 0))) && (((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) <= (((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) || ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3)))) && (((var_1_15 + var_1_14) / 65536) <= (((var_1_17 / 65536) + (var_1_14 / 65536)) + (var_1_15 / 65536)))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_17 / 65536) * 65536) + var_1_15) + var_1_14) == ((65536 * ((var_1_15 + var_1_14) / 65536)) + var_1_17))) && (((((var_1_3 / 65536) * 65536) + var_1_2) < (((65536 * (var_1_2 / 65536)) + var_1_3) + 1)) || ((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) + 1)))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) || (((((((((((var_1_19 == (256 * (var_1_19 / 256))) || (((var_1_18 / 256) * 256) == var_1_18)) && !((((var_1_13 / 256) * 256) == var_1_13))) && !((\result == 0))) && ((((var_1_4 / 65536) * 65536) + var_1_2) < ((((65536 * (var_1_2 / 65536)) + var_1_4) + var_1_1) + 1))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_4 / 65536) * 65536) + var_1_3) == ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1)) || (((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) <= (((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536))) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) || (((((((((((!((((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && ((((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1)) && ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3))) || (((((var_1_4 / 65536) * 65536) + var_1_2) <= (((65536 * (var_1_2 / 65536)) + var_1_4) + var_1_1)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((var_1_3 + var_1_2) + (var_1_5 / 4294967296)) == (((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) + ((var_1_3 / 65536) * 65536)) + (65536 * (var_1_2 / 65536))))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && ((((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1) < ((((var_1_4 / 65536) * 65536) + var_1_3) + 1)) || (((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) <= (((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536))) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((((var_1_17 / 65536) * 65536) + var_1_15) + var_1_14) == ((65536 * ((var_1_15 + var_1_14) / 65536)) + var_1_17))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && (((((var_1_4 / 65536) * 65536) + var_1_2) + 1) <= ((65536 * (var_1_2 / 65536)) + var_1_4))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) [2023-11-06 21:56:19,001 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((65536 * (var_1_2 / 65536)) + var_1_3) < (((var_1_3 / 65536) * 65536) + var_1_2)) || (((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) + 1))) && ((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1))) && (((((((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_3) + var_1_15) == ((65536 * ((((var_1_14 * 65535) + var_1_3) + var_1_15) / 65536)) + var_1_12)) && (((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && (((65536 * (var_1_2 / 65536)) + var_1_4) <= (((var_1_4 / 65536) * 65536) + var_1_2))) || ((((((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_3) + var_1_15) == ((65536 * ((((var_1_14 * 65535) + var_1_3) + var_1_15) / 65536)) + var_1_12)) && (((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && ((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) + ((var_1_3 / 65536) * 65536)) + (65536 * (var_1_2 / 65536))) <= ((var_1_3 + var_1_2) + (var_1_5 / 4294967296)))))) && (((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) <= (((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) || ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3)))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_3 / 65536) * 65536) + var_1_2) < (((65536 * (var_1_2 / 65536)) + var_1_3) + 1)) || ((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) + 1)))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1)))) || ((((((((((((!((((var_1_13 / 256) * 256) == var_1_13)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) < (((var_1_3 / 65536) * 65536) + var_1_2)) || (((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) + 1)))) && ((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1))) && !((\result == 0))) && (((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) <= (((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) || ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3)))) && (((var_1_15 + var_1_14) / 65536) <= (((var_1_17 / 65536) + (var_1_14 / 65536)) + (var_1_15 / 65536)))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_17 / 65536) * 65536) + var_1_15) + var_1_14) == ((65536 * ((var_1_15 + var_1_14) / 65536)) + var_1_17))) && (((((var_1_3 / 65536) * 65536) + var_1_2) < (((65536 * (var_1_2 / 65536)) + var_1_3) + 1)) || ((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) + 1)))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) || (((((((((((var_1_19 == (256 * (var_1_19 / 256))) || (((var_1_18 / 256) * 256) == var_1_18)) && !((((var_1_13 / 256) * 256) == var_1_13))) && !((\result == 0))) && ((((var_1_4 / 65536) * 65536) + var_1_2) < ((((65536 * (var_1_2 / 65536)) + var_1_4) + var_1_1) + 1))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_4 / 65536) * 65536) + var_1_3) == ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1)) || (((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) <= (((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536))) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) || (((((((((((!((((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && ((((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1)) && ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3))) || (((((var_1_4 / 65536) * 65536) + var_1_2) <= (((65536 * (var_1_2 / 65536)) + var_1_4) + var_1_1)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((var_1_3 + var_1_2) + (var_1_5 / 4294967296)) == (((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) + ((var_1_3 / 65536) * 65536)) + (65536 * (var_1_2 / 65536))))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && ((((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1) < ((((var_1_4 / 65536) * 65536) + var_1_3) + 1)) || (((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) <= (((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536))) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((((var_1_17 / 65536) * 65536) + var_1_15) + var_1_14) == ((65536 * ((var_1_15 + var_1_14) / 65536)) + var_1_17))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && (((((var_1_4 / 65536) * 65536) + var_1_2) + 1) <= ((65536 * (var_1_2 / 65536)) + var_1_4))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) [2023-11-06 21:56:19,014 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:56:19,015 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 21:56:19,015 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:56:19,016 INFO L158 Benchmark]: Toolchain (without parser) took 109937.44ms. Allocated memory was 142.6MB in the beginning and 465.6MB in the end (delta: 323.0MB). Free memory was 95.7MB in the beginning and 352.7MB in the end (delta: -257.0MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. [2023-11-06 21:56:19,016 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:56:19,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.26ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 82.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 21:56:19,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.02ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 79.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:56:19,017 INFO L158 Benchmark]: Boogie Preprocessor took 49.41ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 78.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:56:19,018 INFO L158 Benchmark]: RCFGBuilder took 629.59ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 59.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 21:56:19,018 INFO L158 Benchmark]: TraceAbstraction took 108667.48ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 154.0MB in the beginning and 358.0MB in the end (delta: -204.0MB). Peak memory consumption was 284.2MB. Max. memory is 16.1GB. [2023-11-06 21:56:19,019 INFO L158 Benchmark]: Witness Printer took 99.48ms. Allocated memory is still 465.6MB. Free memory was 358.0MB in the beginning and 352.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 21:56:19,022 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 142.6MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.26ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 82.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.02ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 79.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.41ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 78.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.59ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 59.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 108667.48ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 154.0MB in the beginning and 358.0MB in the end (delta: -204.0MB). Peak memory consumption was 284.2MB. Max. memory is 16.1GB. * Witness Printer took 99.48ms. Allocated memory is still 465.6MB. Free memory was 358.0MB in the beginning and 352.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 108.5s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 642 SdHoareTripleChecker+Valid, 17.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 5396 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4192 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1488 IncrementalHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1204 mSDtfsCounter, 1488 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=5, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 424 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 248 PreInvPairs, 331 NumberOfFragments, 2317 HoareAnnotationTreeSize, 248 FomulaSimplifications, 184147 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 14819 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 61.7s InterpolantComputationTime, 1348 NumberOfCodeBlocks, 1348 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1340 ConstructedInterpolants, 0 QuantifiedInterpolants, 12833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12096/12096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((65536 * (var_1_2 / 65536)) + var_1_3) < (((var_1_3 / 65536) * 65536) + var_1_2)) || (((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) + 1))) && ((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1))) && (((((((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_3) + var_1_15) == ((65536 * ((((var_1_14 * 65535) + var_1_3) + var_1_15) / 65536)) + var_1_12)) && (((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && (((65536 * (var_1_2 / 65536)) + var_1_4) <= (((var_1_4 / 65536) * 65536) + var_1_2))) || ((((((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_3) + var_1_15) == ((65536 * ((((var_1_14 * 65535) + var_1_3) + var_1_15) / 65536)) + var_1_12)) && (((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && ((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) + ((var_1_3 / 65536) * 65536)) + (65536 * (var_1_2 / 65536))) <= ((var_1_3 + var_1_2) + (var_1_5 / 4294967296)))))) && (((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) <= (((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) || ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3)))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_3 / 65536) * 65536) + var_1_2) < (((65536 * (var_1_2 / 65536)) + var_1_3) + 1)) || ((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) + 1)))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1)))) || ((((((((((((!((((var_1_13 / 256) * 256) == var_1_13)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) < (((var_1_3 / 65536) * 65536) + var_1_2)) || (((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) + 1)))) && ((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1))) && !((\result == 0))) && (((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) <= (((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) || ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3)))) && (((var_1_15 + var_1_14) / 65536) <= (((var_1_17 / 65536) + (var_1_14 / 65536)) + (var_1_15 / 65536)))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_17 / 65536) * 65536) + var_1_15) + var_1_14) == ((65536 * ((var_1_15 + var_1_14) / 65536)) + var_1_17))) && (((((var_1_3 / 65536) * 65536) + var_1_2) < (((65536 * (var_1_2 / 65536)) + var_1_3) + 1)) || ((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) + 1)))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) || (((((((((((var_1_19 == (256 * (var_1_19 / 256))) || (((var_1_18 / 256) * 256) == var_1_18)) && !((((var_1_13 / 256) * 256) == var_1_13))) && !((\result == 0))) && ((((var_1_4 / 65536) * 65536) + var_1_2) < ((((65536 * (var_1_2 / 65536)) + var_1_4) + var_1_1) + 1))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_4 / 65536) * 65536) + var_1_3) == ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1)) || (((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) <= (((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536))) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) || (((((((((((!((((var_1_13 / 256) * 256) == var_1_13)) && !((\result == 0))) && ((((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1)) && ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3))) || (((((var_1_4 / 65536) * 65536) + var_1_2) <= (((65536 * (var_1_2 / 65536)) + var_1_4) + var_1_1)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((var_1_3 + var_1_2) + (var_1_5 / 4294967296)) == (((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) + ((var_1_3 / 65536) * 65536)) + (65536 * (var_1_2 / 65536))))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && ((((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1) < ((((var_1_4 / 65536) * 65536) + var_1_3) + 1)) || (((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) <= (((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536))) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((((var_1_17 / 65536) * 65536) + var_1_15) + var_1_14) == ((65536 * ((var_1_15 + var_1_14) / 65536)) + var_1_17))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && (((((var_1_4 / 65536) * 65536) + var_1_2) + 1) <= ((65536 * (var_1_2 / 65536)) + var_1_4))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1)) && ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3))) || (((((var_1_4 / 65536) * 65536) + var_1_2) <= (((65536 * (var_1_2 / 65536)) + var_1_4) + var_1_1)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2)))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && ((((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1) < ((((var_1_4 / 65536) * 65536) + var_1_3) + 1)) || (((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) <= (((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536))) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1)))) || (((var_1_13 / 256) * 256) == var_1_13)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((((((((65536 * (var_1_2 / 65536)) + var_1_3) < (((var_1_3 / 65536) * 65536) + var_1_2)) || (((65536 * (((var_1_4 * 65535) + var_1_3) / 65536)) + var_1_1) < ((((var_1_4 * 65535) + var_1_3) + ((var_1_1 / 65536) * 65536)) + 1))) && (((var_1_13 / 256) * 256) == var_1_13)) && ((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1))) && !((cond == 0))) && (((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) <= (((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1)) || ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3)))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && (((((var_1_3 / 65536) * 65536) + var_1_2) < (((65536 * (var_1_2 / 65536)) + var_1_3) + 1)) || ((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) < ((((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536)) + 1)))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1)))) || (((((((((((((var_1_4 / 65536) * 65536) + var_1_3) <= ((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1)) && ((((var_1_3 / 65536) * 65536) + var_1_2) <= ((65536 * (var_1_2 / 65536)) + var_1_3))) || (((((var_1_4 / 65536) * 65536) + var_1_2) <= (((65536 * (var_1_2 / 65536)) + var_1_4) + var_1_1)) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2)))) && !((cond == 0))) && ((((var_1_9 + var_1_8) + var_1_11) + var_1_10) == var_1_7)) && ((((((var_1_3 / 65536) * 65536) + var_1_4) + var_1_1) < ((((var_1_4 / 65536) * 65536) + var_1_3) + 1)) || (((((((var_1_4 * 65535) + var_1_2) / 65536) * 65536) + var_1_1) <= (((var_1_4 * 65535) + var_1_2) + ((var_1_1 / 65536) * 65536))) && ((((65536 * (var_1_2 / 65536)) + var_1_3) + 1) <= (((var_1_3 / 65536) * 65536) + var_1_2))))) && (((16842 + ((var_1_14 / 65536) * 65536)) < var_1_14) || (((1103833641 + (65536 * (var_1_12 / 65536))) + var_1_16) == (var_1_12 + (65536 * ((1103833641 + var_1_16) / 65536)))))) && ((((65536 * ((((var_1_14 * 65535) + var_1_16) + 27636) / 65536)) + var_1_12) == ((((var_1_14 * 65535) + (65536 * (var_1_12 / 65536))) + var_1_16) + 27636)) || (var_1_14 < (16843 + ((var_1_14 / 65536) * 65536))))) && ((((65536 * (var_1_2 / 65536)) + var_1_4) < ((((var_1_4 / 65536) * 65536) + var_1_2) + 1)) || ((((((((((((-281474976645120 * (var_1_3 / 65536)) + 2144048120) + (4294967295 * var_1_3)) + (-281474976645120 * (var_1_2 / 65536))) + (4294967295 * var_1_2)) + var_1_6) / 4294967296) * 4294967296) + ((var_1_2 / 65536) * 281474976645120)) + ((var_1_3 / 65536) * 281474976645120)) + var_1_5) == ((((((var_1_5 / 4294967296) * 4294967296) + 2144048120) + (4294967295 * var_1_3)) + (4294967295 * var_1_2)) + var_1_6)))) && (((((var_1_1 / 65536) + (var_1_2 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_2) / 65536)) + 1)) || ((((var_1_3 / 65536) + (var_1_1 / 65536)) + var_1_4) < (((var_1_4 / 65536) + (((var_1_4 * 65535) + var_1_3) / 65536)) + 1))))) RESULT: Ultimate proved your program to be correct! [2023-11-06 21:56:19,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2070c40-fee4-4fb4-8463-8860ee599e5b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE