./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/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_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/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_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/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 d7e3ed8389d85579f25ce07510934446f3151103b0f238999e98597cb70459b5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:52:40,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:52:40,722 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:52:40,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:52:40,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:52:40,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:52:40,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:52:40,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:52:40,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:52:40,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:52:40,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:52:40,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:52:40,779 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:52:40,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:52:40,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:52:40,782 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:52:40,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:52:40,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:52:40,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:52:40,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:52:40,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:52:40,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:52:40,786 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:52:40,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:52:40,788 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:52:40,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:52:40,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:52:40,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:52:40,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:40,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:52:40,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:52:40,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:52:40,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:52:40,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:52:40,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:52:40,794 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:52:40,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:52:40,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:52:40,795 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:52:40,796 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_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/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_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/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 -> d7e3ed8389d85579f25ce07510934446f3151103b0f238999e98597cb70459b5 [2023-11-06 22:52:41,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:52:41,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:52:41,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:52:41,165 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:52:41,168 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:52:41,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-06 22:52:44,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:52:44,627 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:52:44,628 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-06 22:52:44,640 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/data/a5dd4f728/e4ee18221ac3442ca8d403c5f0230172/FLAG3f0846434 [2023-11-06 22:52:44,664 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/data/a5dd4f728/e4ee18221ac3442ca8d403c5f0230172 [2023-11-06 22:52:44,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:52:44,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:52:44,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:44,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:52:44,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:52:44,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:44,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10124b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44, skipping insertion in model container [2023-11-06 22:52:44,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:44,715 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:52:44,861 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_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2023-11-06 22:52:44,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:44,914 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:52:44,928 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_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2023-11-06 22:52:44,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:52:44,966 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:52:44,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44 WrapperNode [2023-11-06 22:52:44,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:52:44,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:44,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:52:44,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:52:44,977 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:52:44" (1/1) ... [2023-11-06 22:52:44,987 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:52:44" (1/1) ... [2023-11-06 22:52:45,017 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2023-11-06 22:52:45,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:52:45,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:52:45,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:52:45,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:52:45,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:52:45,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:52:45,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:52:45,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:52:45,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (1/1) ... [2023-11-06 22:52:45,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:52:45,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:45,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/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:52:45,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/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:52:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:52:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:52:45,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:52:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:52:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:52:45,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:52:45,289 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:52:45,293 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:52:45,530 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:52:45,537 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:52:45,538 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:52:45,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:45 BoogieIcfgContainer [2023-11-06 22:52:45,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:52:45,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:52:45,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:52:45,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:52:45,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:52:44" (1/3) ... [2023-11-06 22:52:45,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7294044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:45, skipping insertion in model container [2023-11-06 22:52:45,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:52:44" (2/3) ... [2023-11-06 22:52:45,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7294044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:45, skipping insertion in model container [2023-11-06 22:52:45,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:45" (3/3) ... [2023-11-06 22:52:45,554 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-06 22:52:45,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:52:45,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:52:45,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:52:45,650 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;@4e345129, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:52:45,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:52:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:52:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:52:45,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:45,672 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:45,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:45,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -793587933, now seen corresponding path program 1 times [2023-11-06 22:52:45,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:45,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094532735] [2023-11-06 22:52:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:45,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:52:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:52:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:52:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:52:46,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:46,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094532735] [2023-11-06 22:52:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094532735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:46,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:52:46,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900627990] [2023-11-06 22:52:46,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:46,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:52:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:46,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:52:46,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:52:46,119 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:52:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:46,154 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2023-11-06 22:52:46,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:52:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2023-11-06 22:52:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:46,165 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:52:46,166 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:52:46,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:52:46,174 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:46,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:52:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-06 22:52:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:52:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2023-11-06 22:52:46,224 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 63 [2023-11-06 22:52:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:46,224 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2023-11-06 22:52:46,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:52:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2023-11-06 22:52:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:52:46,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:46,229 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:46,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:52:46,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:46,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:46,231 INFO L85 PathProgramCache]: Analyzing trace with hash 514983137, now seen corresponding path program 1 times [2023-11-06 22:52:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:46,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945619772] [2023-11-06 22:52:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:46,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:52:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:52:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:52:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:52:49,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:49,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945619772] [2023-11-06 22:52:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945619772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:49,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:49,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:52:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56119140] [2023-11-06 22:52:49,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:49,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:52:49,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:49,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:52:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:52:49,780 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:52:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:50,921 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2023-11-06 22:52:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:52:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2023-11-06 22:52:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:50,927 INFO L225 Difference]: With dead ends: 131 [2023-11-06 22:52:50,927 INFO L226 Difference]: Without dead ends: 129 [2023-11-06 22:52:50,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:52:50,934 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 105 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:50,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 281 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:52:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-06 22:52:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 73. [2023-11-06 22:52:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:52:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2023-11-06 22:52:51,014 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 63 [2023-11-06 22:52:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:51,015 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2023-11-06 22:52:51,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:52:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2023-11-06 22:52:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:52:51,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:51,019 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:51,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:52:51,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:51,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash 516830179, now seen corresponding path program 1 times [2023-11-06 22:52:51,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:51,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040903624] [2023-11-06 22:52:51,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:52:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:52:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:52,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:52:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:52:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040903624] [2023-11-06 22:52:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040903624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:52:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437984523] [2023-11-06 22:52:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:53,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:52:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:52:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:52:53,009 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:52:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:53,930 INFO L93 Difference]: Finished difference Result 203 states and 275 transitions. [2023-11-06 22:52:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:52:53,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2023-11-06 22:52:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:53,938 INFO L225 Difference]: With dead ends: 203 [2023-11-06 22:52:53,938 INFO L226 Difference]: Without dead ends: 133 [2023-11-06 22:52:53,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:52:53,942 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 120 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:53,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 287 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:52:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-06 22:52:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 107. [2023-11-06 22:52:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 74 states have internal predecessors, (88), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:52:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 142 transitions. [2023-11-06 22:52:54,013 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 142 transitions. Word has length 63 [2023-11-06 22:52:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:54,015 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 142 transitions. [2023-11-06 22:52:54,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:52:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 142 transitions. [2023-11-06 22:52:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:52:54,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:54,028 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:54,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:52:54,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:54,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash -246307624, now seen corresponding path program 1 times [2023-11-06 22:52:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242072720] [2023-11-06 22:52:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:52:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:52:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:52:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:52:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242072720] [2023-11-06 22:52:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242072720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:54,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:52:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696899252] [2023-11-06 22:52:54,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:54,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:52:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:52:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:52:54,289 INFO L87 Difference]: Start difference. First operand 107 states and 142 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:52:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:54,429 INFO L93 Difference]: Finished difference Result 311 states and 409 transitions. [2023-11-06 22:52:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:52:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2023-11-06 22:52:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:54,433 INFO L225 Difference]: With dead ends: 311 [2023-11-06 22:52:54,434 INFO L226 Difference]: Without dead ends: 207 [2023-11-06 22:52:54,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:52:54,437 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 51 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:54,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 142 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-06 22:52:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 157. [2023-11-06 22:52:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 104 states have (on average 1.1538461538461537) internal successors, (120), 105 states have internal predecessors, (120), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:52:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 210 transitions. [2023-11-06 22:52:54,526 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 210 transitions. Word has length 64 [2023-11-06 22:52:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:54,526 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 210 transitions. [2023-11-06 22:52:54,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:52:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 210 transitions. [2023-11-06 22:52:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:52:54,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:54,530 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:54,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:52:54,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:54,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash 13094305, now seen corresponding path program 1 times [2023-11-06 22:52:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:54,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504911894] [2023-11-06 22:52:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:54,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:52:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:52:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:52:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:52:56,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:56,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504911894] [2023-11-06 22:52:56,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504911894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:56,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:52:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:52:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696703117] [2023-11-06 22:52:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:56,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:52:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:56,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:52:56,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:52:56,779 INFO L87 Difference]: Start difference. First operand 157 states and 210 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:52:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:57,386 INFO L93 Difference]: Finished difference Result 308 states and 414 transitions. [2023-11-06 22:52:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:52:57,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2023-11-06 22:52:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:57,391 INFO L225 Difference]: With dead ends: 308 [2023-11-06 22:52:57,392 INFO L226 Difference]: Without dead ends: 249 [2023-11-06 22:52:57,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:52:57,402 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 80 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:57,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 280 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:52:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-06 22:52:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 165. [2023-11-06 22:52:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.1696428571428572) internal successors, (131), 113 states have internal predecessors, (131), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:52:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2023-11-06 22:52:57,466 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 64 [2023-11-06 22:52:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:57,469 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2023-11-06 22:52:57,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:52:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2023-11-06 22:52:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:52:57,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:57,474 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:57,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:52:57,475 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:57,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash 70352607, now seen corresponding path program 1 times [2023-11-06 22:52:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:57,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451119850] [2023-11-06 22:52:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:52:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:52:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:52:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:52:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451119850] [2023-11-06 22:52:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451119850] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816285581] [2023-11-06 22:52:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:57,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:57,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:57,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:57,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:52:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:57,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:52:57,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-06 22:52:58,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:52:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816285581] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:52:58,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:52:58,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-06 22:52:58,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462762071] [2023-11-06 22:52:58,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:58,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:52:58,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:52:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:52:58,269 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:52:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:58,556 INFO L93 Difference]: Finished difference Result 293 states and 373 transitions. [2023-11-06 22:52:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:52:58,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 64 [2023-11-06 22:52:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:58,560 INFO L225 Difference]: With dead ends: 293 [2023-11-06 22:52:58,560 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 22:52:58,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:52:58,568 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 97 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:58,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:52:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 22:52:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 102. [2023-11-06 22:52:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 73 states have internal predecessors, (78), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:52:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2023-11-06 22:52:58,617 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 64 [2023-11-06 22:52:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:58,619 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2023-11-06 22:52:58,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:52:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2023-11-06 22:52:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-06 22:52:58,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:58,628 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 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] [2023-11-06 22:52:58,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:58,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:52:58,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:58,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2108356367, now seen corresponding path program 1 times [2023-11-06 22:52:58,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:58,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663043789] [2023-11-06 22:52:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:58,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:52:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:52:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:52:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:52:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:52:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:52:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:52:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:52:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:52:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:52:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:52:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:52:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:52:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:52:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:52:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:52:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 22:52:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:52:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:52:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:52:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663043789] [2023-11-06 22:52:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663043789] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:59,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72888453] [2023-11-06 22:52:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:59,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:52:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:52:59,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:52:59,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:52:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:52:59,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:52:59,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:52:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-11-06 22:52:59,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:52:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72888453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:52:59,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:52:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-06 22:52:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580293495] [2023-11-06 22:52:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:52:59,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:52:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:59,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:52:59,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:52:59,224 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:52:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:59,268 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2023-11-06 22:52:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:52:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2023-11-06 22:52:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:59,270 INFO L225 Difference]: With dead ends: 146 [2023-11-06 22:52:59,270 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:52:59,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 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:52:59,272 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:59,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:52:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:52:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:52:59,274 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:52:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:52:59,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2023-11-06 22:52:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:59,274 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:52:59,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:52:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:52:59,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:52:59,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:52:59,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:52:59,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:52:59,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:53:00,748 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-06 22:53:00,748 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:53:00,748 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:53:00,749 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-11-06 22:53:00,749 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (and (<= ~var_1_11~0 (* (div ~var_1_11~0 256) 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= ~var_1_17~0 ~var_1_11~0) (= ~var_1_8~0 0)) [2023-11-06 22:53:00,749 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 38 58) no Hoare annotation was computed. [2023-11-06 22:53:00,749 INFO L899 garLoopResultBuilder]: For program point L73(lines 59 74) no Hoare annotation was computed. [2023-11-06 22:53:00,749 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 83 95) the Hoare annotation is: true [2023-11-06 22:53:00,750 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-06 22:53:00,750 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= (* 256 (div ~var_1_17~0 256)) ~var_1_17~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,750 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2023-11-06 22:53:00,750 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= (* 256 (div ~var_1_17~0 256)) ~var_1_17~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,750 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:53:00,750 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (<= ~var_1_11~0 (* (div ~var_1_11~0 256) 256)) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= ~var_1_17~0 ~var_1_11~0) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,751 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:53:00,751 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2023-11-06 22:53:00,751 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:53:00,751 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-11-06 22:53:00,751 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 79 82) the Hoare annotation is: (let ((.cse0 (= (* 256 (div ~var_1_17~0 256)) ~var_1_17~0)) (.cse1 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse3 (= (* (div ~last_1_var_1_5~0 256) 256) ~last_1_var_1_5~0)) (.cse2 (= ~var_1_5~0 0)) (.cse4 (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) (.cse5 (= ~var_1_17~0 ~var_1_11~0)) (.cse6 (= ~var_1_15~0 ~var_1_14~0)) (.cse7 (= ~var_1_16~0 ~var_1_13~0)) (.cse8 (let ((.cse12 (and (= 128 ~var_1_12~0) (<= ~var_1_13~0 127))) (.cse13 (<= 128 ~var_1_13~0)) (.cse11 (* (div ~var_1_13~0 65536) 65536))) (or (and (<= (+ .cse11 32768) ~var_1_13~0) (or .cse12 (and .cse13 (= (+ 65536 .cse11 ~var_1_12~0) ~var_1_13~0)))) (and (or .cse12 (and (= (+ .cse11 ~var_1_12~0) ~var_1_13~0) .cse13)) (<= ~var_1_13~0 (+ 32767 .cse11)))))) (.cse9 (= ~var_1_8~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< 252 ~var_1_12~0) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 (let ((.cse10 (= ~var_1_7~0 (* (div ~var_1_7~0 256) 256)))) (or (and .cse2 .cse10) (and (not .cse10) (= ~var_1_5~0 1)))) (< ~var_1_12~0 253) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-11-06 22:53:00,751 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-06 22:53:00,752 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* 256 (div ~var_1_17~0 256)) ~var_1_17~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,752 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* 256 (div ~var_1_17~0 256)) ~var_1_17~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:53:00,752 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 87 93) no Hoare annotation was computed. [2023-11-06 22:53:00,752 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (let ((.cse0 (<= ~var_1_11~0 (* (div ~var_1_11~0 256) 256))) (.cse1 (= ~var_1_17~0 ~var_1_11~0)) (.cse2 (= ~var_1_8~0 0))) (or (and .cse0 (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2) (and .cse0 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2))) [2023-11-06 22:53:00,752 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-11-06 22:53:00,752 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 78) no Hoare annotation was computed. [2023-11-06 22:53:00,753 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:53:00,753 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 58) no Hoare annotation was computed. [2023-11-06 22:53:00,753 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-06 22:53:00,753 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (<= ~var_1_11~0 (* (div ~var_1_11~0 256) 256)) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= ~var_1_17~0 ~var_1_11~0) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,753 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (<= ~var_1_11~0 (* (div ~var_1_11~0 256) 256)) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= ~var_1_17~0 ~var_1_11~0) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,753 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= (* 256 (div ~var_1_17~0 256)) ~var_1_17~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,753 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= (* 256 (div ~var_1_17~0 256)) ~var_1_17~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-06 22:53:00,754 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-06 22:53:00,754 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 43) no Hoare annotation was computed. [2023-11-06 22:53:00,754 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:53:00,754 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:53:00,754 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:53:00,754 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:53:00,758 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:00,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:53:00,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:53:00 BoogieIcfgContainer [2023-11-06 22:53:00,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:53:00,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:53:00,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:53:00,797 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:53:00,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:45" (3/4) ... [2023-11-06 22:53:00,799 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:53:00,804 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:53:00,812 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:53:00,812 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:53:00,813 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:53:00,813 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:53:00,846 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((256 * (var_1_17 / 256)) == var_1_17) && (1 <= \result)) && (var_1_5 == 0)) && (((last_1_var_1_5 / 256) * 256) == last_1_var_1_5)) && (0 <= k_loop)) && (var_1_17 == var_1_11)) && (252 < var_1_12)) && (var_1_15 == var_1_14)) && (var_1_16 == var_1_13)) && ((((((var_1_13 / 65536) * 65536) + 32768) <= var_1_13) && (((128 == var_1_12) && (var_1_13 <= 127)) || ((128 <= var_1_13) && (((65536 + ((var_1_13 / 65536) * 65536)) + var_1_12) == var_1_13)))) || ((((128 == var_1_12) && (var_1_13 <= 127)) || (((((var_1_13 / 65536) * 65536) + var_1_12) == var_1_13) && (128 <= var_1_13))) && (var_1_13 <= (32767 + ((var_1_13 / 65536) * 65536)))))) && (var_1_8 == 0)) || ((((((((((((256 * (var_1_17 / 256)) == var_1_17) && (1 <= \result)) && (((last_1_var_1_5 / 256) * 256) == last_1_var_1_5)) && (((var_1_5 == 0) && (var_1_7 == ((var_1_7 / 256) * 256))) || (!((var_1_7 == ((var_1_7 / 256) * 256))) && (var_1_5 == 1)))) && (var_1_12 < 253)) && (0 <= k_loop)) && (var_1_17 == var_1_11)) && (var_1_15 == var_1_14)) && (var_1_16 == var_1_13)) && ((((((var_1_13 / 65536) * 65536) + 32768) <= var_1_13) && (((128 == var_1_12) && (var_1_13 <= 127)) || ((128 <= var_1_13) && (((65536 + ((var_1_13 / 65536) * 65536)) + var_1_12) == var_1_13)))) || ((((128 == var_1_12) && (var_1_13 <= 127)) || (((((var_1_13 / 65536) * 65536) + var_1_12) == var_1_13) && (128 <= var_1_13))) && (var_1_13 <= (32767 + ((var_1_13 / 65536) * 65536)))))) && (var_1_8 == 0))) [2023-11-06 22:53:00,885 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((256 * (var_1_17 / 256)) == var_1_17) && (1 <= \result)) && (var_1_5 == 0)) && (((last_1_var_1_5 / 256) * 256) == last_1_var_1_5)) && (0 <= k_loop)) && (var_1_17 == var_1_11)) && (252 < var_1_12)) && (var_1_15 == var_1_14)) && (var_1_16 == var_1_13)) && ((((((var_1_13 / 65536) * 65536) + 32768) <= var_1_13) && (((128 == var_1_12) && (var_1_13 <= 127)) || ((128 <= var_1_13) && (((65536 + ((var_1_13 / 65536) * 65536)) + var_1_12) == var_1_13)))) || ((((128 == var_1_12) && (var_1_13 <= 127)) || (((((var_1_13 / 65536) * 65536) + var_1_12) == var_1_13) && (128 <= var_1_13))) && (var_1_13 <= (32767 + ((var_1_13 / 65536) * 65536)))))) && (var_1_8 == 0)) || ((((((((((((256 * (var_1_17 / 256)) == var_1_17) && (1 <= \result)) && (((last_1_var_1_5 / 256) * 256) == last_1_var_1_5)) && (((var_1_5 == 0) && (var_1_7 == ((var_1_7 / 256) * 256))) || (!((var_1_7 == ((var_1_7 / 256) * 256))) && (var_1_5 == 1)))) && (var_1_12 < 253)) && (0 <= k_loop)) && (var_1_17 == var_1_11)) && (var_1_15 == var_1_14)) && (var_1_16 == var_1_13)) && ((((((var_1_13 / 65536) * 65536) + 32768) <= var_1_13) && (((128 == var_1_12) && (var_1_13 <= 127)) || ((128 <= var_1_13) && (((65536 + ((var_1_13 / 65536) * 65536)) + var_1_12) == var_1_13)))) || ((((128 == var_1_12) && (var_1_13 <= 127)) || (((((var_1_13 / 65536) * 65536) + var_1_12) == var_1_13) && (128 <= var_1_13))) && (var_1_13 <= (32767 + ((var_1_13 / 65536) * 65536)))))) && (var_1_8 == 0))) [2023-11-06 22:53:00,906 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:53:00,906 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:53:00,906 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:53:00,907 INFO L158 Benchmark]: Toolchain (without parser) took 16235.12ms. Allocated memory was 209.7MB in the beginning and 375.4MB in the end (delta: 165.7MB). Free memory was 164.6MB in the beginning and 272.0MB in the end (delta: -107.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2023-11-06 22:53:00,908 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory was 72.2MB in the beginning and 72.2MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:00,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.08ms. Allocated memory is still 209.7MB. Free memory was 164.3MB in the beginning and 152.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:53:00,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.12ms. Allocated memory is still 209.7MB. Free memory was 152.4MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:00,910 INFO L158 Benchmark]: Boogie Preprocessor took 35.73ms. Allocated memory is still 209.7MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:00,911 INFO L158 Benchmark]: RCFGBuilder took 485.12ms. Allocated memory is still 209.7MB. Free memory was 148.9MB in the beginning and 135.0MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:53:00,912 INFO L158 Benchmark]: TraceAbstraction took 15250.42ms. Allocated memory was 209.7MB in the beginning and 375.4MB in the end (delta: 165.7MB). Free memory was 134.3MB in the beginning and 276.1MB in the end (delta: -141.9MB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. [2023-11-06 22:53:00,912 INFO L158 Benchmark]: Witness Printer took 110.38ms. Allocated memory is still 375.4MB. Free memory was 276.1MB in the beginning and 272.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:53:00,915 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.33ms. Allocated memory is still 104.9MB. Free memory was 72.2MB in the beginning and 72.2MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.08ms. Allocated memory is still 209.7MB. Free memory was 164.3MB in the beginning and 152.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.12ms. Allocated memory is still 209.7MB. Free memory was 152.4MB in the beginning and 150.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.73ms. Allocated memory is still 209.7MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 485.12ms. Allocated memory is still 209.7MB. Free memory was 148.9MB in the beginning and 135.0MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15250.42ms. Allocated memory was 209.7MB in the beginning and 375.4MB in the end (delta: 165.7MB). Free memory was 134.3MB in the beginning and 276.1MB in the end (delta: -141.9MB). Peak memory consumption was 173.7MB. Max. memory is 16.1GB. * Witness Printer took 110.38ms. Allocated memory is still 375.4MB. Free memory was 276.1MB in the beginning and 272.0MB 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 468 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 454 mSDsluCounter, 1207 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 830 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 601 IncrementalHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 377 mSDtfsCounter, 601 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 245 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 160 PreInvPairs, 177 NumberOfFragments, 583 HoareAnnotationTreeSize, 160 FomulaSimplifications, 29817 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 1632 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 2483 SizeOfPredicates, 4 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 2385/2422 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: 83]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((((256 * (var_1_17 / 256)) == var_1_17) && (1 <= \result)) && (var_1_5 == 0)) && (((last_1_var_1_5 / 256) * 256) == last_1_var_1_5)) && (0 <= k_loop)) && (var_1_17 == var_1_11)) && (252 < var_1_12)) && (var_1_15 == var_1_14)) && (var_1_16 == var_1_13)) && ((((((var_1_13 / 65536) * 65536) + 32768) <= var_1_13) && (((128 == var_1_12) && (var_1_13 <= 127)) || ((128 <= var_1_13) && (((65536 + ((var_1_13 / 65536) * 65536)) + var_1_12) == var_1_13)))) || ((((128 == var_1_12) && (var_1_13 <= 127)) || (((((var_1_13 / 65536) * 65536) + var_1_12) == var_1_13) && (128 <= var_1_13))) && (var_1_13 <= (32767 + ((var_1_13 / 65536) * 65536)))))) && (var_1_8 == 0)) || ((((((((((((256 * (var_1_17 / 256)) == var_1_17) && (1 <= \result)) && (((last_1_var_1_5 / 256) * 256) == last_1_var_1_5)) && (((var_1_5 == 0) && (var_1_7 == ((var_1_7 / 256) * 256))) || (!((var_1_7 == ((var_1_7 / 256) * 256))) && (var_1_5 == 1)))) && (var_1_12 < 253)) && (0 <= k_loop)) && (var_1_17 == var_1_11)) && (var_1_15 == var_1_14)) && (var_1_16 == var_1_13)) && ((((((var_1_13 / 65536) * 65536) + 32768) <= var_1_13) && (((128 == var_1_12) && (var_1_13 <= 127)) || ((128 <= var_1_13) && (((65536 + ((var_1_13 / 65536) * 65536)) + var_1_12) == var_1_13)))) || ((((128 == var_1_12) && (var_1_13 <= 127)) || (((((var_1_13 / 65536) * 65536) + var_1_12) == var_1_13) && (128 <= var_1_13))) && (var_1_13 <= (32767 + ((var_1_13 / 65536) * 65536)))))) && (var_1_8 == 0))) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((var_1_11 <= ((var_1_11 / 256) * 256)) && (var_1_5 == 0)) && (0 <= k_loop)) && (var_1_17 == var_1_11)) && (var_1_8 == 0)) || ((((var_1_11 <= ((var_1_11 / 256) * 256)) && (1 <= k_loop)) && (var_1_17 == var_1_11)) && (var_1_8 == 0))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((var_1_11 <= ((var_1_11 / 256) * 256)) && (0 <= k_loop)) && (var_1_17 == var_1_11)) && (var_1_8 == 0)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:53:00,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bf3d35a-786d-4ea9-aaba-9a49c45f4b38/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