./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/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_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/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_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/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 f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:14:21,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:14:21,434 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:14:21,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:14:21,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:14:21,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:14:21,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:14:21,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:14:21,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:14:21,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:14:21,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:14:21,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:14:21,502 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:14:21,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:14:21,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:14:21,505 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:14:21,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:14:21,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:14:21,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:14:21,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:14:21,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:14:21,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:14:21,508 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:14:21,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:14:21,509 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:14:21,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:14:21,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:14:21,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:14:21,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:21,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:14:21,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:14:21,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:14:21,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:14:21,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:14:21,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:14:21,515 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:14:21,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:14:21,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:14:21,516 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:14:21,516 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_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/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_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/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 -> f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce [2023-11-06 22:14:21,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:14:21,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:14:21,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:14:21,867 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:14:21,868 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:14:21,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2023-11-06 22:14:25,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:14:25,453 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:14:25,453 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2023-11-06 22:14:25,466 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/data/06bd07f6c/0953146463d54aaab3260057ea71ba5f/FLAG826e2a490 [2023-11-06 22:14:25,483 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/data/06bd07f6c/0953146463d54aaab3260057ea71ba5f [2023-11-06 22:14:25,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:14:25,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:14:25,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:25,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:14:25,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:14:25,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a856268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25, skipping insertion in model container [2023-11-06 22:14:25,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,535 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:14:25,688 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_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i[915,928] [2023-11-06 22:14:25,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:25,746 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:14:25,760 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_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i[915,928] [2023-11-06 22:14:25,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:25,809 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:14:25,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25 WrapperNode [2023-11-06 22:14:25,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:25,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:25,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:14:25,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:14:25,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,869 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2023-11-06 22:14:25,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:25,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:14:25,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:14:25,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:14:25,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:14:25,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:14:25,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:14:25,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:14:25,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (1/1) ... [2023-11-06 22:14:25,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:25,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:25,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:14:25,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:14:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:14:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:14:26,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:14:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:14:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:14:26,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:14:26,084 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:14:26,087 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:14:26,368 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:14:26,375 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:14:26,376 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:14:26,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:26 BoogieIcfgContainer [2023-11-06 22:14:26,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:14:26,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:14:26,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:14:26,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:14:26,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:14:25" (1/3) ... [2023-11-06 22:14:26,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed26328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:26, skipping insertion in model container [2023-11-06 22:14:26,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:25" (2/3) ... [2023-11-06 22:14:26,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed26328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:26, skipping insertion in model container [2023-11-06 22:14:26,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:26" (3/3) ... [2023-11-06 22:14:26,394 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-39.i [2023-11-06 22:14:26,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:14:26,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:14:26,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:26,470 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;@99e3de2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:26,470 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:14:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:14:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 22:14:26,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:26,490 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:14:26,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:26,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash 705531536, now seen corresponding path program 1 times [2023-11-06 22:14:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:26,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221368879] [2023-11-06 22:14:26,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:26,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:27,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:27,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:27,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:27,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:14:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:27,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:14:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:28,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:14:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:14:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:28,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:28,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:28,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:14:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:28,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:14:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:14:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:14:28,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221368879] [2023-11-06 22:14:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221368879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:28,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:28,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:14:28,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852734324] [2023-11-06 22:14:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:28,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:14:28,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:28,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:14:28,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:14:28,190 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:28,533 INFO L93 Difference]: Finished difference Result 157 states and 275 transitions. [2023-11-06 22:14:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:14:28,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2023-11-06 22:14:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:28,551 INFO L225 Difference]: With dead ends: 157 [2023-11-06 22:14:28,552 INFO L226 Difference]: Without dead ends: 113 [2023-11-06 22:14:28,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:14:28,563 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:28,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 168 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:14:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-06 22:14:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2023-11-06 22:14:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:14:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2023-11-06 22:14:28,644 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 87 [2023-11-06 22:14:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:28,645 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2023-11-06 22:14:28,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:28,646 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2023-11-06 22:14:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:14:28,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:28,650 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:14:28,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:14:28,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:28,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1626825182, now seen corresponding path program 1 times [2023-11-06 22:14:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:28,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376336832] [2023-11-06 22:14:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:14:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:14:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:14:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:14:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:14:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:14:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:14:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:14:30,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:30,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376336832] [2023-11-06 22:14:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376336832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:30,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:14:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321945072] [2023-11-06 22:14:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:30,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:14:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:30,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:14:30,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:14:30,248 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:31,551 INFO L93 Difference]: Finished difference Result 190 states and 271 transitions. [2023-11-06 22:14:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:14:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2023-11-06 22:14:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:31,557 INFO L225 Difference]: With dead ends: 190 [2023-11-06 22:14:31,557 INFO L226 Difference]: Without dead ends: 188 [2023-11-06 22:14:31,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:14:31,560 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 53 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:31,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 458 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:14:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-06 22:14:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 97. [2023-11-06 22:14:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:14:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2023-11-06 22:14:31,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 88 [2023-11-06 22:14:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:31,617 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2023-11-06 22:14:31,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2023-11-06 22:14:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:14:31,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:31,621 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:14:31,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:14:31,621 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:31,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1628672224, now seen corresponding path program 1 times [2023-11-06 22:14:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304249729] [2023-11-06 22:14:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:14:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:14:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:14:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:14:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:14:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:14:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:14:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:14:33,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:33,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304249729] [2023-11-06 22:14:33,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304249729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:33,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:33,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:14:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091153834] [2023-11-06 22:14:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:33,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:14:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:33,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:14:33,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:14:33,954 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:35,177 INFO L93 Difference]: Finished difference Result 184 states and 264 transitions. [2023-11-06 22:14:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:14:35,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2023-11-06 22:14:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:35,181 INFO L225 Difference]: With dead ends: 184 [2023-11-06 22:14:35,181 INFO L226 Difference]: Without dead ends: 182 [2023-11-06 22:14:35,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:14:35,183 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 48 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:35,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 298 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:14:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-06 22:14:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 97. [2023-11-06 22:14:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:14:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2023-11-06 22:14:35,264 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 88 [2023-11-06 22:14:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:35,265 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2023-11-06 22:14:35,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2023-11-06 22:14:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 22:14:35,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:35,267 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:14:35,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:14:35,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:35,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash -448020475, now seen corresponding path program 1 times [2023-11-06 22:14:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305198449] [2023-11-06 22:14:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:14:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:14:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:14:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:14:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:14:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:14:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:14:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:14:35,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:35,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305198449] [2023-11-06 22:14:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305198449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:35,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:14:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176557473] [2023-11-06 22:14:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:35,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:14:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:14:35,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:14:35,501 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:35,628 INFO L93 Difference]: Finished difference Result 233 states and 326 transitions. [2023-11-06 22:14:35,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:14:35,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2023-11-06 22:14:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:35,635 INFO L225 Difference]: With dead ends: 233 [2023-11-06 22:14:35,635 INFO L226 Difference]: Without dead ends: 139 [2023-11-06 22:14:35,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:35,645 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:35,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 167 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:14:35,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-06 22:14:35,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2023-11-06 22:14:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:14:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2023-11-06 22:14:35,712 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 89 [2023-11-06 22:14:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:35,715 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2023-11-06 22:14:35,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2023-11-06 22:14:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-06 22:14:35,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:35,729 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:35,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:14:35,730 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:35,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:35,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1109662877, now seen corresponding path program 1 times [2023-11-06 22:14:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:35,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20592361] [2023-11-06 22:14:35,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:14:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:14:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:14:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:14:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:14:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:14:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:14:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:14:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:14:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:14:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:14:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:14:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:14:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:14:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-06 22:14:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-06 22:14:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:14:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:14:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:14:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-06 22:14:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2023-11-06 22:14:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20592361] [2023-11-06 22:14:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20592361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:37,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:14:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880953966] [2023-11-06 22:14:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:37,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:14:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:37,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:14:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:14:37,330 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:38,742 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2023-11-06 22:14:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:14:38,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2023-11-06 22:14:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:38,746 INFO L225 Difference]: With dead ends: 236 [2023-11-06 22:14:38,747 INFO L226 Difference]: Without dead ends: 234 [2023-11-06 22:14:38,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:14:38,749 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 74 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:38,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 675 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:14:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-11-06 22:14:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 134. [2023-11-06 22:14:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:14:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2023-11-06 22:14:38,804 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 174 [2023-11-06 22:14:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:38,805 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2023-11-06 22:14:38,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2023-11-06 22:14:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-06 22:14:38,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:38,809 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:38,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:14:38,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:38,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1107815835, now seen corresponding path program 1 times [2023-11-06 22:14:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:38,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878501399] [2023-11-06 22:14:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:14:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:14:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 22:14:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:14:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:14:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:14:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:14:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:14:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:14:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:14:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:14:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:14:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:14:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:14:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:14:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:14:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 22:14:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-06 22:14:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-06 22:14:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:14:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:14:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:14:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-06 22:14:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2023-11-06 22:14:40,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:40,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878501399] [2023-11-06 22:14:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878501399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:40,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:40,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:14:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635203302] [2023-11-06 22:14:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:40,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:14:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:40,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:14:40,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:14:40,556 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:42,053 INFO L93 Difference]: Finished difference Result 230 states and 329 transitions. [2023-11-06 22:14:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:14:42,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2023-11-06 22:14:42,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:42,055 INFO L225 Difference]: With dead ends: 230 [2023-11-06 22:14:42,055 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:14:42,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:14:42,058 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 57 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:42,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 654 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:14:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:14:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:14:42,060 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 22:14:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:14:42,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2023-11-06 22:14:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:42,060 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:14:42,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:14:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:14:42,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:14:42,064 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:14:42,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:14:42,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:14:43,434 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-11-06 22:14:43,434 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:14:43,434 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:14:43,435 INFO L899 garLoopResultBuilder]: For program point L81(lines 60 82) no Hoare annotation was computed. [2023-11-06 22:14:43,435 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) [2023-11-06 22:14:43,435 INFO L902 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: true [2023-11-06 22:14:43,435 INFO L902 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: true [2023-11-06 22:14:43,436 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 91 102) the Hoare annotation is: false [2023-11-06 22:14:43,436 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-11-06 22:14:43,436 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-11-06 22:14:43,436 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-11-06 22:14:43,436 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2023-11-06 22:14:43,437 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-06 22:14:43,437 INFO L902 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: true [2023-11-06 22:14:43,437 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-11-06 22:14:43,437 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:14:43,437 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:14:43,438 INFO L902 garLoopResultBuilder]: At program point L94-2(lines 94 100) the Hoare annotation is: true [2023-11-06 22:14:43,438 INFO L899 garLoopResultBuilder]: For program point L94-3(lines 94 100) no Hoare annotation was computed. [2023-11-06 22:14:43,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:14:43,438 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-06 22:14:43,440 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 87 90) the Hoare annotation is: (let ((.cse14 (div ~var_1_14~0 256))) (let ((.cse6 (= (* (div ~var_1_13~0 256) 256) ~var_1_13~0)) (.cse7 (= (* 256 (div ~var_1_12~0 256)) ~var_1_12~0)) (.cse1 (= (* 256 (div ~last_1_var_1_10~0 256)) ~last_1_var_1_10~0)) (.cse9 (* 256 .cse14))) (let ((.cse0 (= (+ ~var_1_6~0 .cse9) ~var_1_14~0)) (.cse2 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse10 (or (= (+ (* (div ~var_1_16~0 256) 256) ~var_1_14~0) (+ .cse9 ~var_1_16~0)) (< ~var_1_3~0 ~last_1_var_1_6~0) .cse1)) (.cse4 (or (not .cse6) (not .cse7))) (.cse8 (let ((.cse13 (* ~var_1_14~0 65535))) (let ((.cse11 (* 65536 (div (+ .cse13 16 (* (- 16776960) .cse14)) 65536))) (.cse12 (* .cse14 16776960))) (or (and (= (+ 65520 .cse11 ~var_1_1~0 .cse12) .cse13) (<= (+ 32752 .cse11 .cse12) .cse13)) (and (<= .cse13 (+ 32751 .cse11 .cse12)) (= (+ .cse13 16) (+ .cse11 ~var_1_1~0 .cse12)))))))) (or (let ((.cse3 (* (div ~var_1_10~0 256) 256))) (let ((.cse5 (= .cse3 ~var_1_10~0))) (and .cse0 (not .cse1) .cse2 (or (and (= ~var_1_10~0 (+ .cse3 1)) .cse4) .cse5) (<= (+ ~var_1_3~0 1) ~last_1_var_1_6~0) (or (and .cse6 .cse7) (not .cse5)) .cse8))) (and .cse0 .cse2 (not (= (+ ~var_1_14~0 ~var_1_11~0) .cse9)) (not (= (+ .cse9 ~var_1_11~0) ~var_1_14~0)) .cse10 .cse8) (and .cse0 .cse2 .cse10 (or (and (= ~var_1_10~0 1) .cse4) (and (= ~var_1_10~0 0) .cse6 .cse7)) .cse8))))) [2023-11-06 22:14:43,441 INFO L902 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: true [2023-11-06 22:14:43,443 INFO L902 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: true [2023-11-06 22:14:43,443 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-11-06 22:14:43,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:14:43,443 INFO L902 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: true [2023-11-06 22:14:43,443 INFO L902 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: true [2023-11-06 22:14:43,444 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 86) no Hoare annotation was computed. [2023-11-06 22:14:43,444 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-06 22:14:43,444 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 54) no Hoare annotation was computed. [2023-11-06 22:14:43,444 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-06 22:14:43,444 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:14:43,444 INFO L902 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: true [2023-11-06 22:14:43,444 INFO L902 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: true [2023-11-06 22:14:43,444 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 59) no Hoare annotation was computed. [2023-11-06 22:14:43,444 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-11-06 22:14:43,445 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-11-06 22:14:43,445 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-11-06 22:14:43,445 INFO L902 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: true [2023-11-06 22:14:43,445 INFO L902 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: true [2023-11-06 22:14:43,445 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-06 22:14:43,445 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-06 22:14:43,446 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:14:43,446 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:14:43,446 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:14:43,446 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:14:43,453 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:14:43,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:14:43,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:14:43 BoogieIcfgContainer [2023-11-06 22:14:43,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:14:43,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:14:43,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:14:43,482 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:14:43,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:26" (3/4) ... [2023-11-06 22:14:43,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:14:43,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:14:43,495 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:14:43,495 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:14:43,496 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:14:43,496 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:14:43,526 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && !(((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (1 <= \result)) && (((var_1_10 == (((var_1_10 / 256) * 256) + 1)) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 / 256) * 256) == var_1_10))) && ((var_1_3 + 1) <= last_1_var_1_6)) && (((((var_1_13 / 256) * 256) == var_1_13) && ((256 * (var_1_12 / 256)) == var_1_12)) || !((((var_1_10 / 256) * 256) == var_1_10)))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960)))))) || (((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && (1 <= \result)) && !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256))))) && !((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) || ((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && (1 <= \result)) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (((var_1_10 == 1) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 == 0) && (((var_1_13 / 256) * 256) == var_1_13)) && ((256 * (var_1_12 / 256)) == var_1_12)))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) [2023-11-06 22:14:43,559 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && !(((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (1 <= \result)) && (((var_1_10 == (((var_1_10 / 256) * 256) + 1)) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 / 256) * 256) == var_1_10))) && ((var_1_3 + 1) <= last_1_var_1_6)) && (((((var_1_13 / 256) * 256) == var_1_13) && ((256 * (var_1_12 / 256)) == var_1_12)) || !((((var_1_10 / 256) * 256) == var_1_10)))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960)))))) || (((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && (1 <= \result)) && !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256))))) && !((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) || ((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && (1 <= \result)) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (((var_1_10 == 1) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 == 0) && (((var_1_13 / 256) * 256) == var_1_13)) && ((256 * (var_1_12 / 256)) == var_1_12)))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) [2023-11-06 22:14:43,578 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:14:43,578 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:14:43,579 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:14:43,579 INFO L158 Benchmark]: Toolchain (without parser) took 18091.02ms. Allocated memory was 163.6MB in the beginning and 346.0MB in the end (delta: 182.5MB). Free memory was 132.9MB in the beginning and 222.3MB in the end (delta: -89.4MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2023-11-06 22:14:43,580 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 121.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:14:43,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.11ms. Allocated memory is still 163.6MB. Free memory was 132.9MB in the beginning and 120.9MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:14:43,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.12ms. Allocated memory is still 163.6MB. Free memory was 120.9MB in the beginning and 117.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:43,581 INFO L158 Benchmark]: Boogie Preprocessor took 51.88ms. Allocated memory is still 163.6MB. Free memory was 117.7MB in the beginning and 116.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:43,581 INFO L158 Benchmark]: RCFGBuilder took 455.48ms. Allocated memory is still 163.6MB. Free memory was 116.2MB in the beginning and 101.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:14:43,582 INFO L158 Benchmark]: TraceAbstraction took 17094.74ms. Allocated memory was 163.6MB in the beginning and 346.0MB in the end (delta: 182.5MB). Free memory was 100.3MB in the beginning and 226.5MB in the end (delta: -126.2MB). Peak memory consumption was 176.4MB. Max. memory is 16.1GB. [2023-11-06 22:14:43,582 INFO L158 Benchmark]: Witness Printer took 97.12ms. Allocated memory is still 346.0MB. Free memory was 226.5MB in the beginning and 222.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:43,587 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.34ms. Allocated memory is still 121.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.11ms. Allocated memory is still 163.6MB. Free memory was 132.9MB in the beginning and 120.9MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.12ms. Allocated memory is still 163.6MB. Free memory was 120.9MB in the beginning and 117.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.88ms. Allocated memory is still 163.6MB. Free memory was 117.7MB in the beginning and 116.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.48ms. Allocated memory is still 163.6MB. Free memory was 116.2MB in the beginning and 101.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17094.74ms. Allocated memory was 163.6MB in the beginning and 346.0MB in the end (delta: 182.5MB). Free memory was 100.3MB in the beginning and 226.5MB in the end (delta: -126.2MB). Peak memory consumption was 176.4MB. Max. memory is 16.1GB. * Witness Printer took 97.12ms. Allocated memory is still 346.0MB. Free memory was 226.5MB in the beginning and 222.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 2420 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1842 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 772 IncrementalHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 578 mSDtfsCounter, 772 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=4, InterpolantAutomatonStates: 83, 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, 6 MinimizatonAttempts, 313 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 121 PreInvPairs, 203 NumberOfFragments, 562 HoareAnnotationTreeSize, 121 FomulaSimplifications, 24965 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 3424 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 694 ConstructedInterpolants, 0 QuantifiedInterpolants, 5419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3912/3912 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: 91]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && !(((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (1 <= \result)) && (((var_1_10 == (((var_1_10 / 256) * 256) + 1)) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 / 256) * 256) == var_1_10))) && ((var_1_3 + 1) <= last_1_var_1_6)) && (((((var_1_13 / 256) * 256) == var_1_13) && ((256 * (var_1_12 / 256)) == var_1_12)) || !((((var_1_10 / 256) * 256) == var_1_10)))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960)))))) || (((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && (1 <= \result)) && !(((var_1_14 + var_1_11) == (256 * (var_1_14 / 256))))) && !((((256 * (var_1_14 / 256)) + var_1_11) == var_1_14))) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) || ((((((var_1_6 + (256 * (var_1_14 / 256))) == var_1_14) && (1 <= \result)) && ((((((var_1_16 / 256) * 256) + var_1_14) == ((256 * (var_1_14 / 256)) + var_1_16)) || (var_1_3 < last_1_var_1_6)) || ((256 * (last_1_var_1_10 / 256)) == last_1_var_1_10))) && (((var_1_10 == 1) && (!((((var_1_13 / 256) * 256) == var_1_13)) || !(((256 * (var_1_12 / 256)) == var_1_12)))) || (((var_1_10 == 0) && (((var_1_13 / 256) * 256) == var_1_13)) && ((256 * (var_1_12 / 256)) == var_1_12)))) && ((((((65520 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + var_1_1) + ((var_1_14 / 256) * 16776960)) == (var_1_14 * 65535)) && (((32752 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960)) <= (var_1_14 * 65535))) || (((var_1_14 * 65535) <= ((32751 + (65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536))) + ((var_1_14 / 256) * 16776960))) && (((var_1_14 * 65535) + 16) == (((65536 * ((((var_1_14 * 65535) + 16) + (-16776960 * (var_1_14 / 256))) / 65536)) + var_1_1) + ((var_1_14 / 256) * 16776960))))))) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: !((cond == 0)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:14:43,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dec8a8d-a2ef-48df-bc0d-3a49a81e3df5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE