./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:00:40,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:00:40,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:00:40,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:00:40,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:00:40,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:00:40,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:00:40,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:00:40,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:00:40,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:00:40,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:00:40,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:00:40,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:00:40,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:00:40,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:00:40,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:00:40,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:00:40,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:00:40,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:00:40,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:00:40,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:00:40,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:00:40,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:00:40,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:00:40,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:00:40,646 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:00:40,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:00:40,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:00:40,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:00:40,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:00:40,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:00:40,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:00:40,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:00:40,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:00:40,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:00:40,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:00:40,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:00:40,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:00:40,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:00:40,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:00:40,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:00:40,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:00:40,648 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 [2024-11-10 10:00:40,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:00:40,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:00:40,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:00:40,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:00:40,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:00:40,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i [2024-11-10 10:00:42,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:00:42,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:00:42,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i [2024-11-10 10:00:42,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e8f690a/3b328fbb7b3b4d37a1a2ba899eb9f025/FLAGff432a66a [2024-11-10 10:00:42,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e8f690a/3b328fbb7b3b4d37a1a2ba899eb9f025 [2024-11-10 10:00:42,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:00:42,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:00:42,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:00:42,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:00:42,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:00:42,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f766ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42, skipping insertion in model container [2024-11-10 10:00:42,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:00:42,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i[917,930] [2024-11-10 10:00:42,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:00:42,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:00:42,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i[917,930] [2024-11-10 10:00:42,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:00:42,570 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:00:42,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42 WrapperNode [2024-11-10 10:00:42,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:00:42,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:00:42,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:00:42,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:00:42,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,617 INFO L138 Inliner]: procedures = 30, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-11-10 10:00:42,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:00:42,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:00:42,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:00:42,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:00:42,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,641 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 10:00:42,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:00:42,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:00:42,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:00:42,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:00:42,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (1/1) ... [2024-11-10 10:00:42,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:00:42,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:00:42,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:00:42,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:00:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:00:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 10:00:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 10:00:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 10:00:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 10:00:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 10:00:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 10:00:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:00:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:00:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 10:00:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:00:42,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:00:42,850 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:00:42,851 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:00:43,227 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~mem77#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem94#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite93#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short99#1;havoc property_#t~ite108#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short115#1;havoc property_#t~ite130#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite124#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1; [2024-11-10 10:00:43,263 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-10 10:00:43,263 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:00:43,276 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:00:43,276 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:00:43,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:00:43 BoogieIcfgContainer [2024-11-10 10:00:43,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:00:43,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:00:43,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:00:43,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:00:43,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:00:42" (1/3) ... [2024-11-10 10:00:43,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407195e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:00:43, skipping insertion in model container [2024-11-10 10:00:43,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:42" (2/3) ... [2024-11-10 10:00:43,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@407195e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:00:43, skipping insertion in model container [2024-11-10 10:00:43,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:00:43" (3/3) ... [2024-11-10 10:00:43,283 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-69.i [2024-11-10 10:00:43,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:00:43,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:00:43,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:00:43,356 INFO L333 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, 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;@74db3309, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:00:43,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:00:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:00:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 10:00:43,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:43,374 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:43,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:43,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:43,379 INFO L85 PathProgramCache]: Analyzing trace with hash 842175517, now seen corresponding path program 1 times [2024-11-10 10:00:43,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:43,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126349805] [2024-11-10 10:00:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:43,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:00:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:00:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:00:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:00:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:00:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:00:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:00:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:00:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126349805] [2024-11-10 10:00:43,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126349805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:00:43,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:00:43,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:00:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72297223] [2024-11-10 10:00:43,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:00:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:00:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:00:43,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:00:43,814 INFO L87 Difference]: Start difference. First operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:00:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:00:43,844 INFO L93 Difference]: Finished difference Result 186 states and 292 transitions. [2024-11-10 10:00:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:00:43,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-11-10 10:00:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:00:43,853 INFO L225 Difference]: With dead ends: 186 [2024-11-10 10:00:43,853 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 10:00:43,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:00:43,861 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:00:43,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:00:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 10:00:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-10 10:00:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:00:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-10 10:00:43,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 121 [2024-11-10 10:00:43,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:00:43,893 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-10 10:00:43,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:00:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-10 10:00:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 10:00:43,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:43,897 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:43,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:00:43,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1914848138, now seen corresponding path program 1 times [2024-11-10 10:00:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039802404] [2024-11-10 10:00:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:00:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:00:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:00:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:00:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:00:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:00:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:00:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:00:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:00:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:00:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:00:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:00:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:00:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:00:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:00:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:00:44,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:44,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039802404] [2024-11-10 10:00:44,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039802404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:00:44,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:00:44,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:00:44,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034779930] [2024-11-10 10:00:44,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:00:44,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:00:44,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:44,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:00:44,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:00:44,259 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:00:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:00:44,322 INFO L93 Difference]: Finished difference Result 183 states and 268 transitions. [2024-11-10 10:00:44,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:00:44,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2024-11-10 10:00:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:00:44,344 INFO L225 Difference]: With dead ends: 183 [2024-11-10 10:00:44,344 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 10:00:44,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:00:44,346 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 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 [2024-11-10 10:00:44,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:00:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 10:00:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 10:00:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:00:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-11-10 10:00:44,369 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 121 [2024-11-10 10:00:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:00:44,370 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-11-10 10:00:44,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:00:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-11-10 10:00:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 10:00:44,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:00:44,372 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:00:44,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:00:44,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:00:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:00:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1070631948, now seen corresponding path program 1 times [2024-11-10 10:00:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:00:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942233011] [2024-11-10 10:00:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:00:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 10:00:44,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541983140] [2024-11-10 10:00:44,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:00:44,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:00:44,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:00:44,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:00:44,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:00:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:00:44,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-10 10:00:44,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:00:46,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:00:46,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:00:46,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:00:47,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:00:47,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:00:47,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 10:00:47,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:47,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:47,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:47,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:47,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 10:00:47,992 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-10 10:00:47,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-10 10:00:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:00:48,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:00:48,671 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int))) (or (not (= v_ArrVal_307 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_307 c_~WrapperStruct00_var_1_11_Pointer~0.offset)))) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_307))) (< (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296) (+ (mod (* (select (select .cse0 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset)) 4294967296) 1))))) is different from false [2024-11-10 10:00:54,184 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (v_ArrVal_305 Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_305)))) (or (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_307))) (< (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296) (+ (mod (* (select (select .cse0 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset)) 4294967296) 1))) (< (mod (* (select (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset)) 4294967296) (mod (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296)) (not (= v_ArrVal_307 (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_307 c_~WrapperStruct00_var_1_11_Pointer~0.offset))))))) is different from false [2024-11-10 10:00:54,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:00:54,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942233011] [2024-11-10 10:00:54,970 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 10:00:54,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541983140] [2024-11-10 10:00:54,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541983140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:00:54,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 10:00:54,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-10 10:00:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672896383] [2024-11-10 10:00:54,971 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 10:00:54,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:00:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:00:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:00:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=353, Unknown=2, NotChecked=78, Total=506 [2024-11-10 10:00:54,974 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:02,277 INFO L93 Difference]: Finished difference Result 230 states and 333 transitions. [2024-11-10 10:01:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:01:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2024-11-10 10:01:02,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:02,281 INFO L225 Difference]: With dead ends: 230 [2024-11-10 10:01:02,281 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 10:01:02,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=166, Invalid=596, Unknown=2, NotChecked=106, Total=870 [2024-11-10 10:01:02,284 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 377 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 7 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:02,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 279 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 651 Invalid, 26 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 10:01:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 10:01:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 104. [2024-11-10 10:01:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-11-10 10:01:02,296 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 123 [2024-11-10 10:01:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:02,296 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-11-10 10:01:02,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 10:01:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-11-10 10:01:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 10:01:02,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:02,298 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:02,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:01:02,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:01:02,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:02,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash 565073323, now seen corresponding path program 1 times [2024-11-10 10:01:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:02,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463269216] [2024-11-10 10:01:02,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:03,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463269216] [2024-11-10 10:01:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463269216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:03,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:03,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:01:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579775230] [2024-11-10 10:01:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:03,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:01:03,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:03,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:01:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:01:03,190 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:03,554 INFO L93 Difference]: Finished difference Result 235 states and 340 transitions. [2024-11-10 10:01:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:03,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2024-11-10 10:01:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:03,556 INFO L225 Difference]: With dead ends: 235 [2024-11-10 10:01:03,556 INFO L226 Difference]: Without dead ends: 134 [2024-11-10 10:01:03,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:03,560 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 212 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:03,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 303 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:01:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-10 10:01:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2024-11-10 10:01:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-11-10 10:01:03,579 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 123 [2024-11-10 10:01:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:03,580 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-11-10 10:01:03,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-11-10 10:01:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 10:01:03,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:03,585 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:03,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:01:03,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:03,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 661807723, now seen corresponding path program 1 times [2024-11-10 10:01:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276407133] [2024-11-10 10:01:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:01:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:01:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:01:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:01:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:01:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:01:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:01:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:01:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 10:01:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 10:01:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:01:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 10:01:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 10:01:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:01:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 10:01:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 10:01:04,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:01:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276407133] [2024-11-10 10:01:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276407133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:01:04,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:01:04,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:01:04,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873997312] [2024-11-10 10:01:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:01:04,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:01:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:01:04,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:01:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:01:04,218 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:01:04,698 INFO L93 Difference]: Finished difference Result 247 states and 357 transitions. [2024-11-10 10:01:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:01:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2024-11-10 10:01:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:01:04,700 INFO L225 Difference]: With dead ends: 247 [2024-11-10 10:01:04,700 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 10:01:04,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:01:04,701 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 167 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:01:04,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 350 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 10:01:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 10:01:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2024-11-10 10:01:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 10:01:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-10 10:01:04,717 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 123 [2024-11-10 10:01:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:01:04,718 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-10 10:01:04,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 10:01:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-10 10:01:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 10:01:04,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:01:04,723 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:01:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:01:04,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:01:04,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:01:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash 156249098, now seen corresponding path program 1 times [2024-11-10 10:01:04,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:01:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013703142] [2024-11-10 10:01:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:01:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 10:01:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096168680] [2024-11-10 10:01:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:01:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:01:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:01:04,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:01:04,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:01:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:01:05,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-10 10:01:05,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:01:05,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2024-11-10 10:01:05,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:06,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:06,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:06,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:07,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:07,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:07,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:08,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:08,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 70 [2024-11-10 10:01:09,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 152 [2024-11-10 10:02:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:00,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:02:10,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_630))) (< (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296) (+ (mod (* (select (select .cse0 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset)) 4294967296) 1))) (not (= v_ArrVal_630 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_630 c_~WrapperStruct00_var_1_11_Pointer~0.offset)))))) is different from false [2024-11-10 10:02:14,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 Int) (v_ArrVal_630 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_628)))) (or (not (= v_ArrVal_630 (store (select .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_630 c_~WrapperStruct00_var_1_11_Pointer~0.offset)))) (< (mod (* (select (select .cse0 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse0 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) 4294967296) (mod (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296)) (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_630))) (< (mod (select (select .cse1 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 4294967296) (+ (mod (* (select (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (select (select .cse1 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset)) 4294967296) 1)))))) is different from false [2024-11-10 10:02:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013703142] [2024-11-10 10:02:15,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 10:02:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096168680] [2024-11-10 10:02:15,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096168680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:02:15,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 10:02:15,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-10 10:02:15,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743144967] [2024-11-10 10:02:15,504 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 10:02:15,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:02:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:02:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=346, Unknown=11, NotChecked=78, Total=506 [2024-11-10 10:02:15,506 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)