./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/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_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/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_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/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 1825bc9a0285763e27450cd61a02fb9d706f8ecf9bea3df3659a486d8c0885be --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:15:51,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:15:51,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:15:51,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:15:51,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:15:51,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:15:51,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:15:51,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:15:51,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:15:51,139 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:15:51,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:15:51,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:15:51,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:15:51,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:15:51,142 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:15:51,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:15:51,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:15:51,144 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:15:51,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:15:51,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:15:51,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:15:51,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:15:51,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:15:51,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:15:51,165 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:15:51,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:15:51,167 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:15:51,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:15:51,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:15:51,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:15:51,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:15:51,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:15:51,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:15:51,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:15:51,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:15:51,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:15:51,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:15:51,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:15:51,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:15:51,171 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:15:51,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:15:51,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:15:51,171 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_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/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_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/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 -> 1825bc9a0285763e27450cd61a02fb9d706f8ecf9bea3df3659a486d8c0885be [2023-11-29 06:15:51,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:15:51,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:15:51,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:15:51,440 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:15:51,440 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:15:51,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i [2023-11-29 06:15:54,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:15:54,410 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:15:54,410 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i [2023-11-29 06:15:54,420 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/data/cc319e2df/e5accacd0a0847ca9d35e90faab26489/FLAG5219def44 [2023-11-29 06:15:54,433 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/data/cc319e2df/e5accacd0a0847ca9d35e90faab26489 [2023-11-29 06:15:54,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:15:54,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:15:54,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:15:54,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:15:54,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:15:54,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40027d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54, skipping insertion in model container [2023-11-29 06:15:54,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,475 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:15:54,608 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_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i[917,930] [2023-11-29 06:15:54,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:15:54,674 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:15:54,688 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-10.i[917,930] [2023-11-29 06:15:54,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:15:54,736 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:15:54,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54 WrapperNode [2023-11-29 06:15:54,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:15:54,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:15:54,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:15:54,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:15:54,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,803 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2023-11-29 06:15:54,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:15:54,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:15:54,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:15:54,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:15:54,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,843 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 06:15:54,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:15:54,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:15:54,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:15:54,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:15:54,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (1/1) ... [2023-11-29 06:15:54,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:15:54,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:15:54,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:15:54,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8cf636-1cc7-42ad-b765-a9e68d3097ca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:15:54,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:15:54,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:15:54,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:15:54,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:15:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:15:54,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:15:55,071 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:15:55,074 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:15:55,442 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:15:55,474 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:15:55,474 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:15:55,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:15:55 BoogieIcfgContainer [2023-11-29 06:15:55,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:15:55,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:15:55,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:15:55,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:15:55,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:15:54" (1/3) ... [2023-11-29 06:15:55,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485a0937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:15:55, skipping insertion in model container [2023-11-29 06:15:55,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:54" (2/3) ... [2023-11-29 06:15:55,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485a0937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:15:55, skipping insertion in model container [2023-11-29 06:15:55,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:15:55" (3/3) ... [2023-11-29 06:15:55,483 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-10.i [2023-11-29 06:15:55,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:15:55,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:15:55,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:15:55,555 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;@7ea6866a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:15:55,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:15:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 46 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:15:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 06:15:55,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:15:55,577 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:15:55,578 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:15:55,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 30522322, now seen corresponding path program 1 times [2023-11-29 06:15:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:55,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121201713] [2023-11-29 06:15:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:15:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:15:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:15:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:15:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:15:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:15:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:15:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:15:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:15:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:15:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:15:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:15:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:15:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:15:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:15:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:15:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:15:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:15:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:15:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:15:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 06:15:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 06:15:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:15:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 06:15:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 06:15:55,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:55,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121201713] [2023-11-29 06:15:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121201713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:55,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458203261] [2023-11-29 06:15:55,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:56,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:15:56,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:56,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:15:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:15:56,036 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 46 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 06:15:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:15:56,082 INFO L93 Difference]: Finished difference Result 141 states and 250 transitions. [2023-11-29 06:15:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:15:56,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2023-11-29 06:15:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:15:56,094 INFO L225 Difference]: With dead ends: 141 [2023-11-29 06:15:56,094 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 06:15:56,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 06:15:56,102 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:15:56,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:15:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 06:15:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-29 06:15:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:15:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 109 transitions. [2023-11-29 06:15:56,153 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 109 transitions. Word has length 150 [2023-11-29 06:15:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:15:56,154 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 109 transitions. [2023-11-29 06:15:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 06:15:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 109 transitions. [2023-11-29 06:15:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 06:15:56,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:15:56,159 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:15:56,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:15:56,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:15:56,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash 621898706, now seen corresponding path program 1 times [2023-11-29 06:15:56,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:56,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887656691] [2023-11-29 06:15:56,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:56,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:56,405 WARN L293 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 222 DAG size of output: 221 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:22:11,874 WARN L293 SmtUtils]: Spent 32.51s on a formula simplification. DAG size of input: 256 DAG size of output: 255 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:22:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:22:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:22:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:22:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:22:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:22:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:22:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:22:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:22:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:22:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:22:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:22:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:22:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:22:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:22:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:22:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:22:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:22:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:22:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:22:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 06:22:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 06:22:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 06:22:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 06:22:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 06:22:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 06:22:11,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:22:11,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887656691] [2023-11-29 06:22:11,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887656691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:22:11,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:22:11,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:22:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472041554] [2023-11-29 06:22:11,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:22:11,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:22:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:22:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:22:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:22:11,986 INFO L87 Difference]: Start difference. First operand 70 states and 109 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 06:22:35,341 WARN L293 SmtUtils]: Spent 22.23s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:23:06,313 WARN L293 SmtUtils]: Spent 26.85s on a formula simplification that was a NOOP. DAG size: 267 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:23:10,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:23:15,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:23:19,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:23:29,052 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 256 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:23:33,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:23:45,833 WARN L293 SmtUtils]: Spent 12.51s on a formula simplification that was a NOOP. DAG size: 222 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:23:52,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:23:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:23:52,384 INFO L93 Difference]: Finished difference Result 213 states and 328 transitions. [2023-11-29 06:23:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:23:52,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2023-11-29 06:23:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:23:52,390 INFO L225 Difference]: With dead ends: 213 [2023-11-29 06:23:52,390 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 06:23:52,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 119.4s TimeCoverageRelationStatistics Valid=63, Invalid=146, Unknown=1, NotChecked=0, Total=210 [2023-11-29 06:23:52,393 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 297 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:23:52,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 374 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 4 Unknown, 0 Unchecked, 23.6s Time] [2023-11-29 06:23:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 06:23:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 85. [2023-11-29 06:23:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 06:23:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 133 transitions. [2023-11-29 06:23:52,412 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 133 transitions. Word has length 150 [2023-11-29 06:23:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:23:52,414 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 133 transitions. [2023-11-29 06:23:52,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 06:23:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 133 transitions. [2023-11-29 06:23:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 06:23:52,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:23:52,418 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:52,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:23:52,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:23:52,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1208704720, now seen corresponding path program 1 times [2023-11-29 06:23:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:23:52,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770263530] [2023-11-29 06:23:52,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:23:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:27:42,181 WARN L293 SmtUtils]: Spent 13.45s on a formula simplification. DAG size of input: 293 DAG size of output: 292 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:30:07,780 WARN L293 SmtUtils]: Spent 42.68s on a formula simplification. DAG size of input: 296 DAG size of output: 295 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)