./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 0e0057cc 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_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/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_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --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.4-dev-0e0057c [2023-11-26 10:49:37,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:49:38,040 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 10:49:38,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:49:38,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:49:38,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:49:38,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:49:38,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:49:38,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:49:38,076 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:49:38,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:49:38,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:49:38,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:49:38,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:49:38,079 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:49:38,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:49:38,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:49:38,080 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:49:38,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:49:38,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:49:38,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:49:38,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:49:38,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:49:38,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:49:38,084 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:49:38,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:49:38,085 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:49:38,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:49:38,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:49:38,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:49:38,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:49:38,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:49:38,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:49:38,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:49:38,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:49:38,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:49:38,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:49:38,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:49:38,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:49:38,089 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:49:38,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:49:38,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:49:38,090 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_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/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_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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-26 10:49:38,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:49:38,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:49:38,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:49:38,370 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:49:38,371 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:49:38,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-26 10:49:41,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:49:41,820 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:49:41,821 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-26 10:49:41,830 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/data/f78d7408b/a1dd083b40ab483abba29f75080abfd4/FLAG06ed88320 [2023-11-26 10:49:41,846 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/data/f78d7408b/a1dd083b40ab483abba29f75080abfd4 [2023-11-26 10:49:41,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:49:41,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:49:41,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:41,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:49:41,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:49:41,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:41" (1/1) ... [2023-11-26 10:49:41,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a9e12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:41, skipping insertion in model container [2023-11-26 10:49:41,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:49:41" (1/1) ... [2023-11-26 10:49:41,906 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:49:42,109 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_669038e5-c6f6-4cb3-83bb-f8de4936a459/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2023-11-26 10:49:42,180 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:42,200 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:49:42,216 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_669038e5-c6f6-4cb3-83bb-f8de4936a459/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2023-11-26 10:49:42,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:49:42,276 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:49:42,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42 WrapperNode [2023-11-26 10:49:42,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:49:42,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:42,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:49:42,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:49:42,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,359 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2023-11-26 10:49:42,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:49:42,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:49:42,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:49:42,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:49:42,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,406 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 10:49:42,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:49:42,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:49:42,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:49:42,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:49:42,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (1/1) ... [2023-11-26 10:49:42,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:49:42,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:42,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:49:42,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:49:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:49:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 10:49:42,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 10:49:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:49:42,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:49:42,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:49:42,630 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:49:42,632 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:49:42,966 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:49:43,032 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:49:43,037 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:49:43,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:43 BoogieIcfgContainer [2023-11-26 10:49:43,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:49:43,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:49:43,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:49:43,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:49:43,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:49:41" (1/3) ... [2023-11-26 10:49:43,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518292b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:49:43, skipping insertion in model container [2023-11-26 10:49:43,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:49:42" (2/3) ... [2023-11-26 10:49:43,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518292b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:49:43, skipping insertion in model container [2023-11-26 10:49:43,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:43" (3/3) ... [2023-11-26 10:49:43,054 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-26 10:49:43,100 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:49:43,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:49:43,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:49:43,177 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=LoopHeads, 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;@2efd1d47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:49:43,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:49:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 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-26 10:49:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:49:43,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:43,192 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] [2023-11-26 10:49:43,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:43,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1387386125, now seen corresponding path program 1 times [2023-11-26 10:49:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:43,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945458011] [2023-11-26 10:49:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 10:49:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:49:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:43,461 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-26 10:49:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:43,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945458011] [2023-11-26 10:49:43,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945458011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:43,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:49:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597924970] [2023-11-26 10:49:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:43,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:49:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:43,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:49:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:49:43,514 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 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) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-26 10:49:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:43,582 INFO L93 Difference]: Finished difference Result 65 states and 106 transitions. [2023-11-26 10:49:43,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:49:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 59 [2023-11-26 10:49:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:43,592 INFO L225 Difference]: With dead ends: 65 [2023-11-26 10:49:43,592 INFO L226 Difference]: Without dead ends: 31 [2023-11-26 10:49:43,596 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-26 10:49:43,601 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:43,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:49:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-26 10:49:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-26 10:49:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-26 10:49:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2023-11-26 10:49:43,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 59 [2023-11-26 10:49:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:43,652 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2023-11-26 10:49:43,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-26 10:49:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2023-11-26 10:49:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:49:43,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:43,659 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] [2023-11-26 10:49:43,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:49:43,660 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:43,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1345174155, now seen corresponding path program 1 times [2023-11-26 10:49:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907211785] [2023-11-26 10:49:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 10:49:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:49:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:46,886 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-26 10:49:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:46,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907211785] [2023-11-26 10:49:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907211785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:49:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544441860] [2023-11-26 10:49:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:46,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:49:46,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:49:46,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:46,899 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-26 10:49:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:47,452 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2023-11-26 10:49:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 10:49:47,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 59 [2023-11-26 10:49:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:47,455 INFO L225 Difference]: With dead ends: 85 [2023-11-26 10:49:47,456 INFO L226 Difference]: Without dead ends: 83 [2023-11-26 10:49:47,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:49:47,458 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 68 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:47,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 139 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-26 10:49:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2023-11-26 10:49:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 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-26 10:49:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2023-11-26 10:49:47,482 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 59 [2023-11-26 10:49:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:47,483 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2023-11-26 10:49:47,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-26 10:49:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2023-11-26 10:49:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-26 10:49:47,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:47,485 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] [2023-11-26 10:49:47,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:49:47,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:47,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1345114573, now seen corresponding path program 1 times [2023-11-26 10:49:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19314523] [2023-11-26 10:49:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 10:49:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:49:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:49,374 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-26 10:49:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:49,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19314523] [2023-11-26 10:49:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19314523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:49,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:49,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:49:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280442986] [2023-11-26 10:49:49,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:49,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:49:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:49,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:49:49,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:49:49,383 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-26 10:49:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:49,975 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2023-11-26 10:49:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:49:49,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 59 [2023-11-26 10:49:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:49,981 INFO L225 Difference]: With dead ends: 215 [2023-11-26 10:49:49,990 INFO L226 Difference]: Without dead ends: 152 [2023-11-26 10:49:49,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:49:49,993 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 61 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:49,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 230 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:49:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-26 10:49:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2023-11-26 10:49:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 10:49:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2023-11-26 10:49:50,072 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 59 [2023-11-26 10:49:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:50,073 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2023-11-26 10:49:50,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-26 10:49:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2023-11-26 10:49:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-26 10:49:50,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:50,075 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] [2023-11-26 10:49:50,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:49:50,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:50,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:50,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2046131806, now seen corresponding path program 1 times [2023-11-26 10:49:50,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:50,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193916609] [2023-11-26 10:49:50,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 10:49:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:49:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,270 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-26 10:49:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:50,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193916609] [2023-11-26 10:49:50,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193916609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:50,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:50,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:49:50,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37652727] [2023-11-26 10:49:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:50,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:49:50,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:50,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:49:50,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:49:50,274 INFO L87 Difference]: Start difference. First operand 129 states and 172 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-26 10:49:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:50,390 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2023-11-26 10:49:50,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:49:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 60 [2023-11-26 10:49:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:50,396 INFO L225 Difference]: With dead ends: 302 [2023-11-26 10:49:50,397 INFO L226 Difference]: Without dead ends: 174 [2023-11-26 10:49:50,402 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-26 10:49:50,409 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:50,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 114 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:49:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-26 10:49:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2023-11-26 10:49:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 95 states have internal predecessors, (112), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-26 10:49:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2023-11-26 10:49:50,488 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 60 [2023-11-26 10:49:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:50,490 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2023-11-26 10:49:50,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-26 10:49:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2023-11-26 10:49:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-26 10:49:50,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:50,498 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] [2023-11-26 10:49:50,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:49:50,499 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:50,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash -271124444, now seen corresponding path program 1 times [2023-11-26 10:49:50,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696106890] [2023-11-26 10:49:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 10:49:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:49:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:50,699 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-26 10:49:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696106890] [2023-11-26 10:49:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696106890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:50,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:50,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:49:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869835646] [2023-11-26 10:49:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:50,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:49:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:49:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:49:50,702 INFO L87 Difference]: Start difference. First operand 150 states and 202 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-26 10:49:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:50,823 INFO L93 Difference]: Finished difference Result 366 states and 490 transitions. [2023-11-26 10:49:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:49:50,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 60 [2023-11-26 10:49:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:50,826 INFO L225 Difference]: With dead ends: 366 [2023-11-26 10:49:50,826 INFO L226 Difference]: Without dead ends: 237 [2023-11-26 10:49:50,827 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-26 10:49:50,828 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:50,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 121 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:49:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-26 10:49:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2023-11-26 10:49:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-26 10:49:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2023-11-26 10:49:50,876 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 60 [2023-11-26 10:49:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:50,876 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2023-11-26 10:49:50,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-26 10:49:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2023-11-26 10:49:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-26 10:49:50,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:50,879 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] [2023-11-26 10:49:50,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:49:50,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:50,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1010277305, now seen corresponding path program 1 times [2023-11-26 10:49:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473388959] [2023-11-26 10:49:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 10:49:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:49:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:53,887 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-26 10:49:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473388959] [2023-11-26 10:49:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473388959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:53,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:49:53,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977138096] [2023-11-26 10:49:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:53,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:49:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:53,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:49:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:53,891 INFO L87 Difference]: Start difference. First operand 171 states and 232 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-26 10:49:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:54,498 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2023-11-26 10:49:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 10:49:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 60 [2023-11-26 10:49:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:54,505 INFO L225 Difference]: With dead ends: 292 [2023-11-26 10:49:54,505 INFO L226 Difference]: Without dead ends: 207 [2023-11-26 10:49:54,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:49:54,506 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:54,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 119 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:49:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-26 10:49:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2023-11-26 10:49:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 113 states have internal predecessors, (131), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-26 10:49:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2023-11-26 10:49:54,558 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 60 [2023-11-26 10:49:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:54,560 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2023-11-26 10:49:54,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-26 10:49:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2023-11-26 10:49:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-26 10:49:54,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:54,563 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] [2023-11-26 10:49:54,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:49:54,566 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:54,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1012124347, now seen corresponding path program 1 times [2023-11-26 10:49:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515946532] [2023-11-26 10:49:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 10:49:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:49:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,795 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-26 10:49:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515946532] [2023-11-26 10:49:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515946532] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456317002] [2023-11-26 10:49:54,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:54,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:54,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:54,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:54,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:49:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:54,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 10:49:54,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:55,043 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-26 10:49:55,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:49:55,206 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-26 10:49:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456317002] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:49:55,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:49:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-11-26 10:49:55,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193450702] [2023-11-26 10:49:55,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:49:55,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 10:49:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:55,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 10:49:55,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:49:55,210 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-26 10:49:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:55,441 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2023-11-26 10:49:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:49:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 60 [2023-11-26 10:49:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:55,443 INFO L225 Difference]: With dead ends: 286 [2023-11-26 10:49:55,443 INFO L226 Difference]: Without dead ends: 111 [2023-11-26 10:49:55,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2023-11-26 10:49:55,445 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:55,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 53 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:49:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-26 10:49:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2023-11-26 10:49:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-26 10:49:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-11-26 10:49:55,475 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 60 [2023-11-26 10:49:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:55,475 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-11-26 10:49:55,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-26 10:49:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-11-26 10:49:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-26 10:49:55,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:49:55,478 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:55,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:55,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-26 10:49:55,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:49:55,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1935994354, now seen corresponding path program 1 times [2023-11-26 10:49:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508717057] [2023-11-26 10:49:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 10:49:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 10:49:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 10:49:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 10:49:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 10:49:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 10:49:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 10:49:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 10:49:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 10:49:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-26 10:49:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-26 10:49:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 10:49:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 10:49:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-26 10:49:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-26 10:49:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-26 10:49:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-26 10:49:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 10:49:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 10:49:55,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:55,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508717057] [2023-11-26 10:49:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508717057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:49:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744428007] [2023-11-26 10:49:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:55,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:55,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:49:55,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:49:55,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:49:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:56,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:49:56,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:49:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-11-26 10:49:56,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:49:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744428007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:56,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:49:56,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-26 10:49:56,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768940189] [2023-11-26 10:49:56,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:56,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:49:56,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:56,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:49:56,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:49:56,085 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-26 10:49:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:49:56,135 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2023-11-26 10:49:56,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:49:56,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 118 [2023-11-26 10:49:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:49:56,136 INFO L225 Difference]: With dead ends: 134 [2023-11-26 10:49:56,136 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 10:49:56,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 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-26 10:49:56,137 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:49:56,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:49:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 10:49:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 10:49:56,139 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-26 10:49:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 10:49:56,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2023-11-26 10:49:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:49:56,139 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 10:49:56,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-26 10:49:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 10:49:56,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 10:49:56,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 10:49:56,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:49:56,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:49:56,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 10:49:57,690 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-26 10:49:57,691 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-26 10:49:57,691 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-26 10:49:57,691 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-11-26 10:49:57,691 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-26 10:49:57,691 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 38 58) no Hoare annotation was computed. [2023-11-26 10:49:57,691 INFO L899 garLoopResultBuilder]: For program point L73(lines 59 74) no Hoare annotation was computed. [2023-11-26 10:49:57,691 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-26 10:49:57,692 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) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,692 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) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,692 INFO L895 garLoopResultBuilder]: At program point L61(line 61) 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) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,692 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2023-11-26 10:49:57,693 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-26 10:49:57,693 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-11-26 10:49:57,693 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-26 10:49:57,693 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse0 (div ~last_1_var_1_5~0 256))) (and (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,693 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 (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,693 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 10:49:57,694 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (let ((.cse0 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0)) (.cse1 (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256)))) (.cse2 (= ~var_1_8~0 0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2) (and .cse0 (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2))) [2023-11-26 10:49:57,694 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-11-26 10:49:57,694 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 10:49:57,694 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 58) no Hoare annotation was computed. [2023-11-26 10:49:57,694 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-26 10:49:57,694 INFO L895 garLoopResultBuilder]: At program point L63(line 63) 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) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,695 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 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,695 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) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,695 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) (= ~var_1_5~0 0) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (<= ~last_1_var_1_5~0 (* .cse0 256)) (= ~var_1_8~0 0) (<= 0 .cse0))) [2023-11-26 10:49:57,695 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-26 10:49:57,695 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 43) no Hoare annotation was computed. [2023-11-26 10:49:57,695 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-26 10:49:57,696 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-26 10:49:57,696 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-26 10:49:57,696 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-26 10:49:57,699 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:57,701 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:49:57,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:49:57 BoogieIcfgContainer [2023-11-26 10:49:57,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:49:57,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:49:57,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:49:57,714 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:49:57,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:49:43" (3/4) ... [2023-11-26 10:49:57,716 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 10:49:57,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-26 10:49:57,725 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-26 10:49:57,725 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-26 10:49:57,725 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 10:49:57,726 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 10:49:57,824 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:49:57,825 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 10:49:57,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:49:57,826 INFO L158 Benchmark]: Toolchain (without parser) took 15974.81ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 125.0MB in the beginning and 269.3MB in the end (delta: -144.3MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2023-11-26 10:49:57,826 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory was 56.3MB in the beginning and 56.2MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:49:57,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.74ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 112.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:49:57,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.24ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 110.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:49:57,827 INFO L158 Benchmark]: Boogie Preprocessor took 86.22ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:49:57,828 INFO L158 Benchmark]: RCFGBuilder took 591.14ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 92.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 10:49:57,828 INFO L158 Benchmark]: TraceAbstraction took 14669.68ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 91.8MB in the beginning and 274.6MB in the end (delta: -182.8MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. [2023-11-26 10:49:57,828 INFO L158 Benchmark]: Witness Printer took 111.75ms. Allocated memory is still 360.7MB. Free memory was 274.6MB in the beginning and 269.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 10:49:57,830 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 107.0MB. Free memory was 56.3MB in the beginning and 56.2MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.74ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 112.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.24ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 110.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.22ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.14ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 92.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14669.68ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 91.8MB in the beginning and 274.6MB in the end (delta: -182.8MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. * Witness Printer took 111.75ms. Allocated memory is still 360.7MB. Free memory was 274.6MB in the beginning and 269.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 872 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 559 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 432 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 313 mSDtfsCounter, 432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 422 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 175 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 226 PreInvPairs, 238 NumberOfFragments, 357 HoareAnnotationTreeSize, 226 FomulaSimplifications, 47741 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1228 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 2654 SizeOfPredicates, 4 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 2525/2562 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: 87]: Loop Invariant Derived loop invariant: (((((((var_1_11 / 256) * 256) == var_1_11) && (1 <= k_loop)) && (var_1_17 <= (256 * (var_1_17 / 256)))) && (var_1_8 == 0)) || (((((((var_1_11 / 256) * 256) == var_1_11) && (var_1_5 == 0)) && (0 <= k_loop)) && (var_1_17 <= (256 * (var_1_17 / 256)))) && (var_1_8 == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-26 10:49:57,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_669038e5-c6f6-4cb3-83bb-f8de4936a459/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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