./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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/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_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya --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-29 03:09:38,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:09:38,909 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:09:38,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:09:38,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:09:38,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:09:38,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:09:38,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:09:38,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:09:38,942 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:09:38,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:09:38,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:09:38,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:09:38,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:09:38,945 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:09:38,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:09:38,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:09:38,947 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:09:38,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:09:38,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:09:38,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:09:38,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:09:38,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:09:38,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:09:38,950 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:09:38,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:09:38,951 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:09:38,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:09:38,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:09:38,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:09:38,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:09:38,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:09:38,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:09:38,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:09:38,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:09:38,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:09:38,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:09:38,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:09:38,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:09:38,955 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:09:38,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:09:38,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:09:38,955 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_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/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_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya 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-29 03:09:39,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:09:39,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:09:39,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:09:39,230 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:09:39,230 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:09:39,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-29 03:09:42,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:09:42,174 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:09:42,174 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-29 03:09:42,181 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/data/8437b3aa0/08273dbfbdb04c07ab7eb3d765d4efeb/FLAGe91160369 [2023-11-29 03:09:42,193 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/data/8437b3aa0/08273dbfbdb04c07ab7eb3d765d4efeb [2023-11-29 03:09:42,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:09:42,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:09:42,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:09:42,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:09:42,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:09:42,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e50917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42, skipping insertion in model container [2023-11-29 03:09:42,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,231 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:09:42,393 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_8710145e-aa36-402e-a8d2-a106e6d217bc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2023-11-29 03:09:42,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:09:42,440 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:09:42,453 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_8710145e-aa36-402e-a8d2-a106e6d217bc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2023-11-29 03:09:42,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:09:42,486 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:09:42,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42 WrapperNode [2023-11-29 03:09:42,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:09:42,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:09:42,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:09:42,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:09:42,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,529 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2023-11-29 03:09:42,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:09:42,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:09:42,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:09:42,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:09:42,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,556 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-29 03:09:42,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:09:42,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:09:42,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:09:42,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:09:42,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (1/1) ... [2023-11-29 03:09:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:09:42,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:09:42,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:09:42,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:09:42,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:09:42,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:09:42,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:09:42,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:09:42,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:09:42,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:09:42,713 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:09:42,715 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:09:42,913 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:09:42,955 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:09:42,955 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:09:42,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:09:42 BoogieIcfgContainer [2023-11-29 03:09:42,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:09:42,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:09:42,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:09:42,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:09:42,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:09:42" (1/3) ... [2023-11-29 03:09:42,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed3987c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:09:42, skipping insertion in model container [2023-11-29 03:09:42,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:09:42" (2/3) ... [2023-11-29 03:09:42,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed3987c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:09:42, skipping insertion in model container [2023-11-29 03:09:42,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:09:42" (3/3) ... [2023-11-29 03:09:42,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-34.i [2023-11-29 03:09:42,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:09:42,982 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:09:43,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:09:43,030 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;@23de5217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:09:43,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:09:43,034 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-29 03:09:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:09:43,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:43,044 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-29 03:09:43,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:43,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1387386125, now seen corresponding path program 1 times [2023-11-29 03:09:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684643096] [2023-11-29 03:09:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:09:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:09:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:09:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:09:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:09:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:09:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:43,314 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-29 03:09:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684643096] [2023-11-29 03:09:43,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684643096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:43,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:43,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:09:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353014434] [2023-11-29 03:09:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:43,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:09:43,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:43,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:09:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:09:43,353 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-29 03:09:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:43,392 INFO L93 Difference]: Finished difference Result 65 states and 106 transitions. [2023-11-29 03:09:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:09:43,395 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-29 03:09:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:43,402 INFO L225 Difference]: With dead ends: 65 [2023-11-29 03:09:43,402 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 03:09:43,405 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-29 03:09:43,409 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-29 03:09:43,410 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-29 03:09:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 03:09:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 03:09:43,443 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-29 03:09:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2023-11-29 03:09:43,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 59 [2023-11-29 03:09:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:43,446 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2023-11-29 03:09:43,447 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-29 03:09:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2023-11-29 03:09:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:09:43,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:43,450 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-29 03:09:43,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:09:43,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:43,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1345174155, now seen corresponding path program 1 times [2023-11-29 03:09:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475083817] [2023-11-29 03:09:43,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:09:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:09:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:09:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:09:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:09:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:09:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:46,098 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-29 03:09:46,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:46,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475083817] [2023-11-29 03:09:46,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475083817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:46,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:46,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:09:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607038978] [2023-11-29 03:09:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:46,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:09:46,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:46,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:09:46,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:46,103 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-29 03:09:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:46,592 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2023-11-29 03:09:46,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:09:46,593 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-29 03:09:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:46,595 INFO L225 Difference]: With dead ends: 85 [2023-11-29 03:09:46,596 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 03:09:46,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:09:46,598 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-29 03:09:46,598 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-29 03:09:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 03:09:46,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2023-11-29 03:09:46,618 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-29 03:09:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2023-11-29 03:09:46,620 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 59 [2023-11-29 03:09:46,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:46,621 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2023-11-29 03:09:46,621 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-29 03:09:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2023-11-29 03:09:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:09:46,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:46,623 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-29 03:09:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:09:46,624 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:46,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1345114573, now seen corresponding path program 1 times [2023-11-29 03:09:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618181920] [2023-11-29 03:09:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:09:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:09:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:09:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:09:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:09:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:09:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,172 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-29 03:09:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:48,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618181920] [2023-11-29 03:09:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618181920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:48,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:48,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:09:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680030721] [2023-11-29 03:09:48,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:48,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:09:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:48,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:09:48,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:09:48,175 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-29 03:09:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:48,623 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2023-11-29 03:09:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:09:48,623 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-29 03:09:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:48,626 INFO L225 Difference]: With dead ends: 215 [2023-11-29 03:09:48,626 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 03:09:48,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:09:48,629 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 61 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-29 03:09:48,629 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-29 03:09:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 03:09:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2023-11-29 03:09:48,663 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-29 03:09:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2023-11-29 03:09:48,665 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 59 [2023-11-29 03:09:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:48,666 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2023-11-29 03:09:48,667 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-29 03:09:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2023-11-29 03:09:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 03:09:48,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:48,668 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-29 03:09:48,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:09:48,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:48,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:48,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2046131806, now seen corresponding path program 1 times [2023-11-29 03:09:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:48,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377408021] [2023-11-29 03:09:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:09:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:09:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:09:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:09:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:09:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:09:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:48,786 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-29 03:09:48,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:48,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377408021] [2023-11-29 03:09:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377408021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:48,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:48,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112541777] [2023-11-29 03:09:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:48,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:09:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:09:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:09:48,789 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-29 03:09:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:48,872 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2023-11-29 03:09:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:09:48,872 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-29 03:09:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:48,875 INFO L225 Difference]: With dead ends: 302 [2023-11-29 03:09:48,875 INFO L226 Difference]: Without dead ends: 174 [2023-11-29 03:09:48,877 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-29 03:09:48,878 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:48,879 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.0s Time] [2023-11-29 03:09:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-29 03:09:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2023-11-29 03:09:48,916 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-29 03:09:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2023-11-29 03:09:48,918 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 60 [2023-11-29 03:09:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:48,919 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2023-11-29 03:09:48,919 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-29 03:09:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2023-11-29 03:09:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 03:09:48,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:48,921 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-29 03:09:48,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:09:48,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:48,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash -271124444, now seen corresponding path program 1 times [2023-11-29 03:09:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630786494] [2023-11-29 03:09:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:09:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:09:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:09:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:09:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:09:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:09:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:49,067 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-29 03:09:49,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:49,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630786494] [2023-11-29 03:09:49,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630786494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:49,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:49,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:09:49,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865970587] [2023-11-29 03:09:49,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:49,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:09:49,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:49,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:09:49,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:09:49,070 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-29 03:09:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:49,173 INFO L93 Difference]: Finished difference Result 366 states and 490 transitions. [2023-11-29 03:09:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:09:49,174 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-29 03:09:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:49,176 INFO L225 Difference]: With dead ends: 366 [2023-11-29 03:09:49,176 INFO L226 Difference]: Without dead ends: 237 [2023-11-29 03:09:49,177 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-29 03:09:49,178 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-29 03:09:49,179 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-29 03:09:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-29 03:09:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2023-11-29 03:09:49,215 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-29 03:09:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2023-11-29 03:09:49,217 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 60 [2023-11-29 03:09:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:49,218 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2023-11-29 03:09:49,218 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-29 03:09:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2023-11-29 03:09:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 03:09:49,219 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:49,220 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-29 03:09:49,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:09:49,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:49,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1010277305, now seen corresponding path program 1 times [2023-11-29 03:09:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629139306] [2023-11-29 03:09:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:09:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:09:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:09:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:09:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:09:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:09:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,188 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-29 03:09:51,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:51,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629139306] [2023-11-29 03:09:51,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629139306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:51,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:09:51,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:09:51,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802210838] [2023-11-29 03:09:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:51,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:09:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:09:51,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:51,191 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-29 03:09:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:51,605 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2023-11-29 03:09:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:09:51,606 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-29 03:09:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:51,608 INFO L225 Difference]: With dead ends: 292 [2023-11-29 03:09:51,608 INFO L226 Difference]: Without dead ends: 207 [2023-11-29 03:09:51,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:09:51,610 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:09:51,610 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.1s Time] [2023-11-29 03:09:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-29 03:09:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2023-11-29 03:09:51,652 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-29 03:09:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2023-11-29 03:09:51,654 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 60 [2023-11-29 03:09:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:51,654 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2023-11-29 03:09:51,654 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-29 03:09:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2023-11-29 03:09:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 03:09:51,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:51,656 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-29 03:09:51,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:09:51,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:51,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1012124347, now seen corresponding path program 1 times [2023-11-29 03:09:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:51,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290112186] [2023-11-29 03:09:51,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:09:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:09:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:09:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:09:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:09:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:09:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,798 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-29 03:09:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290112186] [2023-11-29 03:09:51,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290112186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:09:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069637229] [2023-11-29 03:09:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:51,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:09:51,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:09:51,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:09:51,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:09:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:51,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:09:51,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:51,988 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-29 03:09:51,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:09:52,128 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-29 03:09:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069637229] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:09:52,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:09:52,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-11-29 03:09:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561770472] [2023-11-29 03:09:52,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:09:52,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:09:52,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:09:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:09:52,132 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-29 03:09:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:52,326 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2023-11-29 03:09:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:09:52,326 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-29 03:09:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:52,328 INFO L225 Difference]: With dead ends: 286 [2023-11-29 03:09:52,328 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 03:09:52,329 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-29 03:09:52,329 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-29 03:09:52,330 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-29 03:09:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 03:09:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2023-11-29 03:09:52,356 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-29 03:09:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-11-29 03:09:52,357 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 60 [2023-11-29 03:09:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:52,357 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-11-29 03:09:52,358 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-29 03:09:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-11-29 03:09:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 03:09:52,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:09:52,360 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-29 03:09:52,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:09:52,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 03:09:52,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:09:52,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:09:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1935994354, now seen corresponding path program 1 times [2023-11-29 03:09:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:09:52,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930062043] [2023-11-29 03:09:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:52,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:09:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:09:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:09:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:09:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 03:09:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:09:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:09:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:09:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:09:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 03:09:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 03:09:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 03:09:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:09:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:09:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 03:09:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 03:09:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 03:09:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 03:09:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 03:09:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,678 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-29 03:09:52,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:09:52,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930062043] [2023-11-29 03:09:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930062043] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:09:52,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703798935] [2023-11-29 03:09:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:09:52,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:09:52,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:09:52,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:09:52,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:09:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:09:52,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:09:52,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:09:52,838 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-29 03:09:52,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:09:52,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703798935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:09:52,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:09:52,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-29 03:09:52,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835238109] [2023-11-29 03:09:52,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:09:52,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:09:52,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:09:52,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:09:52,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:09:52,840 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-29 03:09:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:09:52,882 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2023-11-29 03:09:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:09:52,885 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-29 03:09:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:09:52,885 INFO L225 Difference]: With dead ends: 134 [2023-11-29 03:09:52,885 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 03:09:52,886 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-29 03:09:52,887 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-29 03:09:52,887 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-29 03:09:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 03:09:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 03:09:52,888 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-29 03:09:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 03:09:52,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2023-11-29 03:09:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:09:52,889 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 03:09:52,889 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-29 03:09:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 03:09:52,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 03:09:52,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:09:52,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:09:53,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 03:09:53,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 03:09:54,117 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-29 03:09:54,117 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 03:09:54,117 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 03:09:54,117 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-11-29 03:09:54,118 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 03:09:54,118 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 38 58) no Hoare annotation was computed. [2023-11-29 03:09:54,118 INFO L899 garLoopResultBuilder]: For program point L73(lines 59 74) no Hoare annotation was computed. [2023-11-29 03:09:54,118 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-29 03:09:54,118 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-29 03:09:54,118 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-29 03:09:54,118 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-29 03:09:54,118 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2023-11-29 03:09:54,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 03:09:54,119 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-11-29 03:09:54,119 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-29 03:09:54,119 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-29 03:09:54,119 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-29 03:09:54,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 03:09:54,119 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-29 03:09:54,120 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-11-29 03:09:54,120 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 03:09:54,120 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 58) no Hoare annotation was computed. [2023-11-29 03:09:54,120 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-29 03:09:54,120 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-29 03:09:54,120 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-29 03:09:54,120 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-29 03:09:54,120 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-29 03:09:54,120 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-29 03:09:54,121 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 43) no Hoare annotation was computed. [2023-11-29 03:09:54,121 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 03:09:54,121 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 03:09:54,121 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 03:09:54,121 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 03:09:54,124 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:09:54,125 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:09:54,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:09:54 BoogieIcfgContainer [2023-11-29 03:09:54,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:09:54,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:09:54,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:09:54,135 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:09:54,135 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:09:42" (3/4) ... [2023-11-29 03:09:54,137 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 03:09:54,139 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 03:09:54,143 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 03:09:54,143 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 03:09:54,143 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 03:09:54,143 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 03:09:54,235 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:09:54,235 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 03:09:54,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:09:54,236 INFO L158 Benchmark]: Toolchain (without parser) took 12040.00ms. Allocated memory was 180.4MB in the beginning and 377.5MB in the end (delta: 197.1MB). Free memory was 144.2MB in the beginning and 195.3MB in the end (delta: -51.1MB). Peak memory consumption was 144.4MB. Max. memory is 16.1GB. [2023-11-29 03:09:54,237 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:09:54,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.90ms. Allocated memory is still 180.4MB. Free memory was 144.2MB in the beginning and 144.8MB in the end (delta: -627.1kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:09:54,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.30ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:09:54,238 INFO L158 Benchmark]: Boogie Preprocessor took 40.81ms. Allocated memory is still 180.4MB. Free memory was 142.7MB in the beginning and 140.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:09:54,238 INFO L158 Benchmark]: RCFGBuilder took 385.25ms. Allocated memory is still 180.4MB. Free memory was 140.1MB in the beginning and 123.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 03:09:54,239 INFO L158 Benchmark]: TraceAbstraction took 11175.14ms. Allocated memory was 180.4MB in the beginning and 377.5MB in the end (delta: 197.1MB). Free memory was 123.3MB in the beginning and 200.5MB in the end (delta: -77.2MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2023-11-29 03:09:54,239 INFO L158 Benchmark]: Witness Printer took 101.00ms. Allocated memory is still 377.5MB. Free memory was 200.5MB in the beginning and 195.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:09:54,241 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.18ms. Allocated memory is still 117.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.90ms. Allocated memory is still 180.4MB. Free memory was 144.2MB in the beginning and 144.8MB in the end (delta: -627.1kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.30ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.81ms. Allocated memory is still 180.4MB. Free memory was 142.7MB in the beginning and 140.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.25ms. Allocated memory is still 180.4MB. Free memory was 140.1MB in the beginning and 123.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11175.14ms. Allocated memory was 180.4MB in the beginning and 377.5MB in the end (delta: 197.1MB). Free memory was 123.3MB in the beginning and 200.5MB in the end (delta: -77.2MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. * Witness Printer took 101.00ms. Allocated memory is still 377.5MB. Free memory was 200.5MB in the beginning and 195.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 872 SdHoareTripleChecker+Invalid, 0.7s 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.5s 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 175 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 226 PreInvPairs, 238 NumberOfFragments, 357 HoareAnnotationTreeSize, 226 FomulaSimplifications, 47741 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1228 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s 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-29 03:09:54,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8710145e-aa36-402e-a8d2-a106e6d217bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE