./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-p_file-22.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 e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:28:27,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:28:27,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:28:27,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:28:27,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:28:27,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:28:27,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:28:27,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:28:27,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:28:27,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:28:27,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:28:27,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:28:27,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:28:27,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:28:27,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:28:27,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:28:27,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:28:27,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:28:27,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:28:27,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:28:27,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:28:27,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:28:27,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:28:27,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:28:27,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:28:27,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:28:27,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:28:27,573 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:28:27,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:28:27,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:28:27,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:28:27,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:28:27,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:28:27,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:28:27,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:28:27,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:28:27,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:28:27,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:28:27,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:28:27,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:28:27,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:28:27,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:28:27,577 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 -> e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf [2024-11-12 07:28:27,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:28:27,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:28:27,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:28:27,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:28:27,828 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:28:27,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-11-12 07:28:29,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:28:29,317 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:28:29,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-11-12 07:28:29,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78f2f63e/6fe9b427d9444261b2a319a1e6610d26/FLAG61f7fd1b4 [2024-11-12 07:28:29,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78f2f63e/6fe9b427d9444261b2a319a1e6610d26 [2024-11-12 07:28:29,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:28:29,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:28:29,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:28:29,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:28:29,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:28:29,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1651a5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29, skipping insertion in model container [2024-11-12 07:28:29,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:28:29,551 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-p_file-22.i[916,929] [2024-11-12 07:28:29,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:28:29,619 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:28:29,627 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-p_file-22.i[916,929] [2024-11-12 07:28:29,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:28:29,660 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:28:29,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29 WrapperNode [2024-11-12 07:28:29,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:28:29,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:28:29,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:28:29,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:28:29,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,714 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2024-11-12 07:28:29,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:28:29,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:28:29,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:28:29,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:28:29,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,766 INFO L175 MemorySlicer]: Split 96 memory accesses to 11 slices as follows [2, 8, 8, 17, 16, 3, 8, 10, 8, 8, 8]. 18 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1]. [2024-11-12 07:28:29,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:28:29,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:28:29,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:28:29,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:28:29,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (1/1) ... [2024-11-12 07:28:29,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:28:29,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:28:29,847 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-12 07:28:29,849 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-12 07:28:29,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:28:29,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:28:29,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:28:29,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:28:29,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:28:29,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:28:29,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-12 07:28:29,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-12 07:28:29,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-12 07:28:29,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-12 07:28:29,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-12 07:28:29,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-12 07:28:29,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:28:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:28:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:28:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:28:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:28:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:28:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 07:28:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-12 07:28:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-12 07:28:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-12 07:28:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-12 07:28:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:28:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:28:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:28:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:28:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:28:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-12 07:28:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-12 07:28:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-12 07:28:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-12 07:28:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-12 07:28:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-12 07:28:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:28:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-12 07:28:29,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-12 07:28:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:28:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:28:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:28:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:28:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:28:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-12 07:28:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-12 07:28:29,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-12 07:28:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-12 07:28:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-12 07:28:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-12 07:28:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:28:29,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:28:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:28:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:28:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:28:29,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:28:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:28:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:28:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 07:28:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-12 07:28:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-12 07:28:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-12 07:28:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-12 07:28:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:28:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:28:30,047 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:28:30,049 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:28:30,480 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-12 07:28:30,481 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:28:30,494 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:28:30,496 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:28:30,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:28:30 BoogieIcfgContainer [2024-11-12 07:28:30,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:28:30,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:28:30,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:28:30,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:28:30,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:28:29" (1/3) ... [2024-11-12 07:28:30,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0e28ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:28:30, skipping insertion in model container [2024-11-12 07:28:30,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:29" (2/3) ... [2024-11-12 07:28:30,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0e28ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:28:30, skipping insertion in model container [2024-11-12 07:28:30,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:28:30" (3/3) ... [2024-11-12 07:28:30,507 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2024-11-12 07:28:30,519 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:28:30,519 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:28:30,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:28:30,580 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;@537f3a79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:28:30,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:28:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:28:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 07:28:30,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:30,600 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:30,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:30,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:30,607 INFO L85 PathProgramCache]: Analyzing trace with hash -150408858, now seen corresponding path program 1 times [2024-11-12 07:28:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:30,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120867639] [2024-11-12 07:28:30,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:30,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120867639] [2024-11-12 07:28:30,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120867639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:30,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:30,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:28:30,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899897776] [2024-11-12 07:28:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:30,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:28:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:28:30,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:28:30,978 INFO L87 Difference]: Start difference. First operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:28:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:30,999 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-12 07:28:31,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:28:31,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-12 07:28:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:31,008 INFO L225 Difference]: With dead ends: 203 [2024-11-12 07:28:31,008 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 07:28:31,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:28:31,013 INFO L435 NwaCegarLoop]: 146 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, 146 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-12 07:28:31,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:28:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 07:28:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-12 07:28:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:28:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-12 07:28:31,049 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2024-11-12 07:28:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:31,049 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-12 07:28:31,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:28:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-12 07:28:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 07:28:31,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:31,053 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:31,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:28:31,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:31,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:31,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1837976040, now seen corresponding path program 1 times [2024-11-12 07:28:31,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:31,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566804138] [2024-11-12 07:28:31,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:31,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566804138] [2024-11-12 07:28:31,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566804138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:31,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:31,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:28:31,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411604837] [2024-11-12 07:28:31,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:31,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:28:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:31,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:28:31,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:28:31,286 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:28:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:31,330 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2024-11-12 07:28:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:28:31,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-12 07:28:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:31,332 INFO L225 Difference]: With dead ends: 201 [2024-11-12 07:28:31,332 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 07:28:31,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-12 07:28:31,334 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 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-12 07:28:31,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:28:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 07:28:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 07:28:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:28:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-12 07:28:31,344 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 90 [2024-11-12 07:28:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:31,345 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-12 07:28:31,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:28:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-12 07:28:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 07:28:31,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:31,347 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:31,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:28:31,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:31,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1559597978, now seen corresponding path program 1 times [2024-11-12 07:28:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465646588] [2024-11-12 07:28:31,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465646588] [2024-11-12 07:28:32,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465646588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:32,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:28:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809068559] [2024-11-12 07:28:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:32,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:28:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:28:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:28:32,153 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:32,953 INFO L93 Difference]: Finished difference Result 507 states and 733 transitions. [2024-11-12 07:28:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:28:32,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-11-12 07:28:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:32,958 INFO L225 Difference]: With dead ends: 507 [2024-11-12 07:28:32,961 INFO L226 Difference]: Without dead ends: 407 [2024-11-12 07:28:32,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:28:32,963 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 362 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:32,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1028 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:28:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-12 07:28:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 288. [2024-11-12 07:28:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 257 states have (on average 1.4085603112840468) internal successors, (362), 257 states have internal predecessors, (362), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:28:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 416 transitions. [2024-11-12 07:28:33,019 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 416 transitions. Word has length 90 [2024-11-12 07:28:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:33,020 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 416 transitions. [2024-11-12 07:28:33,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 416 transitions. [2024-11-12 07:28:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 07:28:33,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:33,026 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:33,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:28:33,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:33,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash -637900402, now seen corresponding path program 1 times [2024-11-12 07:28:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280239211] [2024-11-12 07:28:33,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:33,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280239211] [2024-11-12 07:28:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280239211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:28:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452262741] [2024-11-12 07:28:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:33,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:28:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:33,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:28:33,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:28:33,188 INFO L87 Difference]: Start difference. First operand 288 states and 416 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:33,209 INFO L93 Difference]: Finished difference Result 591 states and 857 transitions. [2024-11-12 07:28:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:28:33,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-12 07:28:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:33,211 INFO L225 Difference]: With dead ends: 591 [2024-11-12 07:28:33,211 INFO L226 Difference]: Without dead ends: 306 [2024-11-12 07:28:33,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:28:33,213 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:33,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:28:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-12 07:28:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 204. [2024-11-12 07:28:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.3989071038251366) internal successors, (256), 183 states have internal predecessors, (256), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:28:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 292 transitions. [2024-11-12 07:28:33,258 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 292 transitions. Word has length 91 [2024-11-12 07:28:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:33,259 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 292 transitions. [2024-11-12 07:28:33,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 292 transitions. [2024-11-12 07:28:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:28:33,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:33,265 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:33,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:28:33,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:33,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2039272617, now seen corresponding path program 1 times [2024-11-12 07:28:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:33,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679276844] [2024-11-12 07:28:33,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:33,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679276844] [2024-11-12 07:28:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679276844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:33,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:28:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745760978] [2024-11-12 07:28:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:33,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:28:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:28:33,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:28:33,368 INFO L87 Difference]: Start difference. First operand 204 states and 292 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:33,420 INFO L93 Difference]: Finished difference Result 366 states and 523 transitions. [2024-11-12 07:28:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:28:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-12 07:28:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:33,423 INFO L225 Difference]: With dead ends: 366 [2024-11-12 07:28:33,423 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 07:28:33,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:28:33,425 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:33,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:28:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 07:28:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2024-11-12 07:28:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 130 states have internal predecessors, (177), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:28:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2024-11-12 07:28:33,441 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 92 [2024-11-12 07:28:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:33,442 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2024-11-12 07:28:33,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2024-11-12 07:28:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 07:28:33,444 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:33,446 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:33,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:28:33,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:33,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:33,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1737009983, now seen corresponding path program 1 times [2024-11-12 07:28:33,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:33,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009580737] [2024-11-12 07:28:33,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:33,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:28:34,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009580737] [2024-11-12 07:28:34,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009580737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:28:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335183651] [2024-11-12 07:28:34,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:34,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:28:34,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:28:34,137 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-12 07:28:34,145 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-12 07:28:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:34,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 07:28:34,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:28:34,734 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 11 treesize of output 9 [2024-11-12 07:28:34,778 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-12 07:28:34,779 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 1 case distinctions, treesize of input 21 treesize of output 30 [2024-11-12 07:28:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:28:34,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:28:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335183651] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:28:35,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:28:35,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 9] total 21 [2024-11-12 07:28:35,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787887060] [2024-11-12 07:28:35,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:35,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:28:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:35,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:28:35,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:28:35,206 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:35,346 INFO L93 Difference]: Finished difference Result 351 states and 496 transitions. [2024-11-12 07:28:35,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:28:35,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-12 07:28:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:35,348 INFO L225 Difference]: With dead ends: 351 [2024-11-12 07:28:35,348 INFO L226 Difference]: Without dead ends: 252 [2024-11-12 07:28:35,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2024-11-12 07:28:35,349 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 122 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:35,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 793 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:28:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-12 07:28:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 171. [2024-11-12 07:28:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.36) internal successors, (204), 150 states have internal predecessors, (204), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:28:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 240 transitions. [2024-11-12 07:28:35,356 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 240 transitions. Word has length 95 [2024-11-12 07:28:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:35,357 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 240 transitions. [2024-11-12 07:28:35,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 240 transitions. [2024-11-12 07:28:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:28:35,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:35,358 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:35,372 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-12 07:28:35,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 07:28:35,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:35,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1046116147, now seen corresponding path program 1 times [2024-11-12 07:28:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:35,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432936245] [2024-11-12 07:28:35,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:35,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432936245] [2024-11-12 07:28:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432936245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:35,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:35,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:28:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306296140] [2024-11-12 07:28:35,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:35,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:28:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:35,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:28:35,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:28:35,929 INFO L87 Difference]: Start difference. First operand 171 states and 240 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:36,092 INFO L93 Difference]: Finished difference Result 554 states and 783 transitions. [2024-11-12 07:28:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:28:36,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-12 07:28:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:36,095 INFO L225 Difference]: With dead ends: 554 [2024-11-12 07:28:36,095 INFO L226 Difference]: Without dead ends: 434 [2024-11-12 07:28:36,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:28:36,096 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 427 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:36,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 953 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:28:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-12 07:28:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 266. [2024-11-12 07:28:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 235 states have (on average 1.3702127659574468) internal successors, (322), 235 states have internal predecessors, (322), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:28:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 376 transitions. [2024-11-12 07:28:36,107 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 376 transitions. Word has length 96 [2024-11-12 07:28:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:36,107 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 376 transitions. [2024-11-12 07:28:36,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 376 transitions. [2024-11-12 07:28:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:28:36,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:36,108 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:36,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:28:36,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:36,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:36,109 INFO L85 PathProgramCache]: Analyzing trace with hash -777590534, now seen corresponding path program 1 times [2024-11-12 07:28:36,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:36,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405101244] [2024-11-12 07:28:36,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:36,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405101244] [2024-11-12 07:28:36,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405101244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:36,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:36,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:28:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283069248] [2024-11-12 07:28:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:36,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:28:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:28:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:28:36,661 INFO L87 Difference]: Start difference. First operand 266 states and 376 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:36,878 INFO L93 Difference]: Finished difference Result 508 states and 716 transitions. [2024-11-12 07:28:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:28:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-12 07:28:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:36,880 INFO L225 Difference]: With dead ends: 508 [2024-11-12 07:28:36,880 INFO L226 Difference]: Without dead ends: 392 [2024-11-12 07:28:36,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:28:36,881 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 336 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:36,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1228 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:28:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-12 07:28:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 291. [2024-11-12 07:28:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 260 states have (on average 1.373076923076923) internal successors, (357), 260 states have internal predecessors, (357), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:28:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 411 transitions. [2024-11-12 07:28:36,890 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 411 transitions. Word has length 97 [2024-11-12 07:28:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:36,891 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 411 transitions. [2024-11-12 07:28:36,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 411 transitions. [2024-11-12 07:28:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:28:36,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:36,892 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:28:36,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 115068741, now seen corresponding path program 1 times [2024-11-12 07:28:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011971532] [2024-11-12 07:28:36,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:37,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:37,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011971532] [2024-11-12 07:28:37,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011971532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:37,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:28:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37222356] [2024-11-12 07:28:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:37,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:28:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:37,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:28:37,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:28:37,336 INFO L87 Difference]: Start difference. First operand 291 states and 411 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:37,563 INFO L93 Difference]: Finished difference Result 557 states and 784 transitions. [2024-11-12 07:28:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:28:37,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-12 07:28:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:37,566 INFO L225 Difference]: With dead ends: 557 [2024-11-12 07:28:37,566 INFO L226 Difference]: Without dead ends: 433 [2024-11-12 07:28:37,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:28:37,567 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 374 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:37,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1418 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:28:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-12 07:28:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 287. [2024-11-12 07:28:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 256 states have (on average 1.3671875) internal successors, (350), 256 states have internal predecessors, (350), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:28:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 404 transitions. [2024-11-12 07:28:37,576 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 404 transitions. Word has length 97 [2024-11-12 07:28:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:37,577 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 404 transitions. [2024-11-12 07:28:37,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 404 transitions. [2024-11-12 07:28:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:28:37,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:37,578 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:37,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:28:37,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:37,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:37,578 INFO L85 PathProgramCache]: Analyzing trace with hash -48787399, now seen corresponding path program 1 times [2024-11-12 07:28:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:37,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196072040] [2024-11-12 07:28:37,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:37,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:37,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196072040] [2024-11-12 07:28:37,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196072040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:37,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:37,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:28:37,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151344971] [2024-11-12 07:28:37,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:37,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:28:37,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:37,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:28:37,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:28:37,917 INFO L87 Difference]: Start difference. First operand 287 states and 404 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:38,332 INFO L93 Difference]: Finished difference Result 785 states and 1111 transitions. [2024-11-12 07:28:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:28:38,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-12 07:28:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:38,334 INFO L225 Difference]: With dead ends: 785 [2024-11-12 07:28:38,334 INFO L226 Difference]: Without dead ends: 549 [2024-11-12 07:28:38,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:28:38,335 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 243 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:38,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 738 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:28:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-12 07:28:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 299. [2024-11-12 07:28:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 268 states have (on average 1.3619402985074627) internal successors, (365), 268 states have internal predecessors, (365), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:28:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 419 transitions. [2024-11-12 07:28:38,346 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 419 transitions. Word has length 97 [2024-11-12 07:28:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:38,347 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 419 transitions. [2024-11-12 07:28:38,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 419 transitions. [2024-11-12 07:28:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:28:38,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:38,349 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:38,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:28:38,349 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:38,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash 13252215, now seen corresponding path program 1 times [2024-11-12 07:28:38,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:38,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162323875] [2024-11-12 07:28:38,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:38,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:38,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162323875] [2024-11-12 07:28:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162323875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:38,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:28:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036909813] [2024-11-12 07:28:38,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:38,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:28:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:38,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:28:38,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:28:38,497 INFO L87 Difference]: Start difference. First operand 299 states and 419 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:38,549 INFO L93 Difference]: Finished difference Result 487 states and 686 transitions. [2024-11-12 07:28:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:28:38,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-12 07:28:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:38,551 INFO L225 Difference]: With dead ends: 487 [2024-11-12 07:28:38,551 INFO L226 Difference]: Without dead ends: 369 [2024-11-12 07:28:38,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:28:38,554 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 78 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:38,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 630 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:28:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-12 07:28:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 300. [2024-11-12 07:28:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.3568773234200744) internal successors, (365), 269 states have internal predecessors, (365), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:28:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 419 transitions. [2024-11-12 07:28:38,564 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 419 transitions. Word has length 97 [2024-11-12 07:28:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:38,564 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 419 transitions. [2024-11-12 07:28:38,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 419 transitions. [2024-11-12 07:28:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:28:38,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:38,565 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:38,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:28:38,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:38,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash 232106933, now seen corresponding path program 1 times [2024-11-12 07:28:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:38,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064670587] [2024-11-12 07:28:38,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:38,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:39,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:39,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064670587] [2024-11-12 07:28:39,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064670587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:39,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:39,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:28:39,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001292966] [2024-11-12 07:28:39,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:28:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:39,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:28:39,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:28:39,216 INFO L87 Difference]: Start difference. First operand 300 states and 419 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:39,758 INFO L93 Difference]: Finished difference Result 788 states and 1105 transitions. [2024-11-12 07:28:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:28:39,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-12 07:28:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:39,762 INFO L225 Difference]: With dead ends: 788 [2024-11-12 07:28:39,762 INFO L226 Difference]: Without dead ends: 549 [2024-11-12 07:28:39,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:28:39,763 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 354 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:39,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 935 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:28:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-12 07:28:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 312. [2024-11-12 07:28:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 281 states have (on average 1.3523131672597866) internal successors, (380), 281 states have internal predecessors, (380), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:28:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 434 transitions. [2024-11-12 07:28:39,774 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 434 transitions. Word has length 97 [2024-11-12 07:28:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:39,774 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 434 transitions. [2024-11-12 07:28:39,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 434 transitions. [2024-11-12 07:28:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:28:39,775 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:39,775 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:39,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:28:39,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:39,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1762037773, now seen corresponding path program 1 times [2024-11-12 07:28:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464615355] [2024-11-12 07:28:39,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:40,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:40,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464615355] [2024-11-12 07:28:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464615355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:40,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:28:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884556752] [2024-11-12 07:28:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:40,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:28:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:28:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:28:40,669 INFO L87 Difference]: Start difference. First operand 312 states and 434 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 07:28:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:41,824 INFO L93 Difference]: Finished difference Result 698 states and 976 transitions. [2024-11-12 07:28:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:28:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 97 [2024-11-12 07:28:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:41,827 INFO L225 Difference]: With dead ends: 698 [2024-11-12 07:28:41,827 INFO L226 Difference]: Without dead ends: 455 [2024-11-12 07:28:41,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:28:41,828 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 328 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:41,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1081 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:28:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-12 07:28:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 300. [2024-11-12 07:28:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.3568773234200744) internal successors, (365), 269 states have internal predecessors, (365), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:28:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 419 transitions. [2024-11-12 07:28:41,844 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 419 transitions. Word has length 97 [2024-11-12 07:28:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:41,844 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 419 transitions. [2024-11-12 07:28:41,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 07:28:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 419 transitions. [2024-11-12 07:28:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:28:41,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:41,845 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:41,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:28:41,846 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:41,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1495991867, now seen corresponding path program 1 times [2024-11-12 07:28:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:41,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298656688] [2024-11-12 07:28:41,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:28:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298656688] [2024-11-12 07:28:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298656688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:28:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951735496] [2024-11-12 07:28:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:42,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:28:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:28:42,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:28:42,020 INFO L87 Difference]: Start difference. First operand 300 states and 419 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:42,036 INFO L93 Difference]: Finished difference Result 420 states and 586 transitions. [2024-11-12 07:28:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:28:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-12 07:28:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:42,037 INFO L225 Difference]: With dead ends: 420 [2024-11-12 07:28:42,037 INFO L226 Difference]: Without dead ends: 178 [2024-11-12 07:28:42,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:28:42,038 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:42,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:28:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-12 07:28:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-11-12 07:28:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 155 states have internal predecessors, (204), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:28:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 240 transitions. [2024-11-12 07:28:42,048 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 240 transitions. Word has length 98 [2024-11-12 07:28:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:42,048 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 240 transitions. [2024-11-12 07:28:42,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:28:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 240 transitions. [2024-11-12 07:28:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:28:42,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:42,049 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:42,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:28:42,049 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:42,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1620964427, now seen corresponding path program 1 times [2024-11-12 07:28:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543262587] [2024-11-12 07:28:42,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:28:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543262587] [2024-11-12 07:28:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543262587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:28:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825632633] [2024-11-12 07:28:42,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:42,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:28:42,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:28:42,539 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-12 07:28:42,539 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-12 07:28:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:42,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 07:28:42,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:28:42,969 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-12 07:28:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 32 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:28:43,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:28:44,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 87 [2024-11-12 07:28:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-12 07:28:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825632633] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:28:44,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:28:44,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11, 14] total 33 [2024-11-12 07:28:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642974968] [2024-11-12 07:28:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:44,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:28:44,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:28:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 07:28:44,602 INFO L87 Difference]: Start difference. First operand 176 states and 240 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 07:28:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:46,614 INFO L93 Difference]: Finished difference Result 350 states and 477 transitions. [2024-11-12 07:28:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 07:28:46,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 99 [2024-11-12 07:28:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:46,617 INFO L225 Difference]: With dead ends: 350 [2024-11-12 07:28:46,617 INFO L226 Difference]: Without dead ends: 239 [2024-11-12 07:28:46,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=367, Invalid=1613, Unknown=0, NotChecked=0, Total=1980 [2024-11-12 07:28:46,618 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 703 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:46,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 690 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:28:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-12 07:28:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 188. [2024-11-12 07:28:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 166 states have (on average 1.3072289156626506) internal successors, (217), 166 states have internal predecessors, (217), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:28:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 253 transitions. [2024-11-12 07:28:46,633 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 253 transitions. Word has length 99 [2024-11-12 07:28:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:46,633 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 253 transitions. [2024-11-12 07:28:46,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-12 07:28:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 253 transitions. [2024-11-12 07:28:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:28:46,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:46,635 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:46,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:28:46,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 07:28:46,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:46,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1402109709, now seen corresponding path program 1 times [2024-11-12 07:28:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:46,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252611760] [2024-11-12 07:28:46,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:28:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:28:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:28:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:28:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:28:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:28:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:28:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:28:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:28:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-12 07:28:47,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:28:47,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252611760] [2024-11-12 07:28:47,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252611760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:28:47,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285716691] [2024-11-12 07:28:47,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:28:47,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:28:47,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:28:47,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 07:28:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:47,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 07:28:47,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:28:47,835 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 23 treesize of output 3 [2024-11-12 07:28:48,149 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 11 treesize of output 9 [2024-11-12 07:28:48,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2024-11-12 07:28:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:28:48,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:28:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285716691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:28:48,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:28:48,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2024-11-12 07:28:48,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966617212] [2024-11-12 07:28:48,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:28:48,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 07:28:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:28:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 07:28:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-12 07:28:48,876 INFO L87 Difference]: Start difference. First operand 188 states and 253 transitions. Second operand has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-12 07:28:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:49,801 INFO L93 Difference]: Finished difference Result 389 states and 523 transitions. [2024-11-12 07:28:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 07:28:49,802 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 99 [2024-11-12 07:28:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:49,806 INFO L225 Difference]: With dead ends: 389 [2024-11-12 07:28:49,806 INFO L226 Difference]: Without dead ends: 274 [2024-11-12 07:28:49,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=504, Invalid=1658, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 07:28:49,807 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 809 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:28:49,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1249 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:28:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-12 07:28:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 194. [2024-11-12 07:28:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 170 states have internal predecessors, (218), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:28:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 254 transitions. [2024-11-12 07:28:49,830 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 254 transitions. Word has length 99 [2024-11-12 07:28:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:49,830 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 254 transitions. [2024-11-12 07:28:49,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-12 07:28:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2024-11-12 07:28:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 07:28:49,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:49,831 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:49,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 07:28:50,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:28:50,033 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:50,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:50,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1726767386, now seen corresponding path program 1 times [2024-11-12 07:28:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:28:50,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583647849] [2024-11-12 07:28:50,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:28:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:28:50,092 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:28:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:28:50,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:28:50,202 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:28:50,207 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:28:50,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:28:50,210 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:28:50,315 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:28:50,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:28:50 BoogieIcfgContainer [2024-11-12 07:28:50,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:28:50,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:28:50,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:28:50,325 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:28:50,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:28:30" (3/4) ... [2024-11-12 07:28:50,327 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:28:50,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:28:50,328 INFO L158 Benchmark]: Toolchain (without parser) took 20983.47ms. Allocated memory was 176.2MB in the beginning and 524.3MB in the end (delta: 348.1MB). Free memory was 117.9MB in the beginning and 320.2MB in the end (delta: -202.3MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. [2024-11-12 07:28:50,328 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:28:50,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.55ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 102.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 07:28:50,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.43ms. Allocated memory is still 176.2MB. Free memory was 102.2MB in the beginning and 98.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:28:50,332 INFO L158 Benchmark]: Boogie Preprocessor took 91.30ms. Allocated memory is still 176.2MB. Free memory was 98.5MB in the beginning and 93.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 07:28:50,333 INFO L158 Benchmark]: RCFGBuilder took 689.64ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 93.2MB in the beginning and 192.0MB in the end (delta: -98.8MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-11-12 07:28:50,333 INFO L158 Benchmark]: TraceAbstraction took 19821.64ms. Allocated memory was 243.3MB in the beginning and 524.3MB in the end (delta: 281.0MB). Free memory was 192.0MB in the beginning and 321.3MB in the end (delta: -129.3MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. [2024-11-12 07:28:50,333 INFO L158 Benchmark]: Witness Printer took 6.45ms. Allocated memory is still 524.3MB. Free memory was 321.3MB in the beginning and 320.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:28:50,334 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.55ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 102.2MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.43ms. Allocated memory is still 176.2MB. Free memory was 102.2MB in the beginning and 98.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.30ms. Allocated memory is still 176.2MB. Free memory was 98.5MB in the beginning and 93.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 689.64ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 93.2MB in the beginning and 192.0MB in the end (delta: -98.8MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19821.64ms. Allocated memory was 243.3MB in the beginning and 524.3MB in the end (delta: 281.0MB). Free memory was 192.0MB in the beginning and 321.3MB in the end (delta: -129.3MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. * Witness Printer took 6.45ms. Allocated memory is still 524.3MB. Free memory was 321.3MB in the beginning and 320.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of bitwiseAnd at line 62, overapproximation of someBinaryArithmeticFLOAToperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L22] signed short int var_1_1 = -5; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned short int var_1_5 = 256; [L26] unsigned short int var_1_5 = 256; [L27] unsigned short int* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 44772; [L28] unsigned short int var_1_6 = 44772; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] float var_1_7 = 5.9; [L30] float var_1_7 = 5.9; [L31] float* var_1_7_Pointer = &(var_1_7); [L32] float var_1_8 = 7.6; [L32] float var_1_8 = 7.6; [L33] float* var_1_8_Pointer = &(var_1_8); [L34] float var_1_9 = 64.2; [L34] float var_1_9 = 64.2; [L35] float* var_1_9_Pointer = &(var_1_9); [L36] float var_1_10 = 128.75; [L36] float var_1_10 = 128.75; [L37] float* var_1_10_Pointer = &(var_1_10); [L38] unsigned long int var_1_11 = 8; [L38] unsigned long int var_1_11 = 8; [L39] unsigned long int* var_1_11_Pointer = &(var_1_11); [L40] unsigned long int var_1_12 = 3135928546; [L40] unsigned long int var_1_12 = 3135928546; [L41] unsigned long int* var_1_12_Pointer = &(var_1_12); [L42] signed short int last_1_var_1_1 = -5; [L43] unsigned long int last_1_var_1_11 = 8; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] EXPR \read(var_1_1) [L93] last_1_var_1_1 = var_1_1 [L94] EXPR \read(var_1_11) [L94] last_1_var_1_11 = var_1_11 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L76] var_1_4 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] var_1_6 = __VERIFIER_nondet_ushort() [L80] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] var_1_8 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F [L83] EXPR \read(var_1_8) [L83] EXPR var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR (var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_9 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F [L85] EXPR \read(var_1_9) [L85] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_10 = __VERIFIER_nondet_float() [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L87] EXPR \read(var_1_10) [L87] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_12 = __VERIFIER_nondet_ulong() [L89] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET updateVariables() [L106] CALL step() [L47] signed long int stepLocal_0 = last_1_var_1_1; [L48] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L48] COND TRUE (*(var_1_4_Pointer)) [L49] (*(var_1_5_Pointer)) = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR \read(*var_1_5_Pointer) [L55] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND TRUE (*(var_1_5_Pointer)) == (*(var_1_5_Pointer)) [L56] EXPR \read(*var_1_5_Pointer) [L56] (*(var_1_1_Pointer)) = ((*(var_1_5_Pointer)) + -16) [L62] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR (*(var_1_5_Pointer)) & last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND TRUE last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) [L63] EXPR ((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR ((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] (*(var_1_11_Pointer)) = ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))) [L71] EXPR \read(*var_1_1_Pointer) [L71] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] COND TRUE (*(var_1_1_Pointer)) < (*(var_1_5_Pointer)) [L72] EXPR \read(*var_1_8_Pointer) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR \read(*var_1_10_Pointer) [L72] (*(var_1_7_Pointer)) = (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR ((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) [L97] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) [L97] EXPR \read(*var_1_5_Pointer) [L97] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) [L97] EXPR \read(*var_1_1_Pointer) [L97] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 [L97] EXPR \read(*var_1_7_Pointer) [L97] EXPR \read(*var_1_8_Pointer) [L97] EXPR \read(*var_1_9_Pointer) [L97] EXPR \read(*var_1_10_Pointer) [L97] EXPR ((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR ((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97-L98] return (((((*(var_1_5_Pointer)) == (*(var_1_5_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_5_Pointer)) + -16))) : ((*(var_1_4_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_5_Pointer)) == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? ((*(var_1_5_Pointer)) == ((unsigned short int) ((((last_1_var_1_11) > (((*(var_1_6_Pointer)) - 8))) ? (last_1_var_1_11) : (((*(var_1_6_Pointer)) - 8)))))) : 1))) && (((*(var_1_1_Pointer)) < (*(var_1_5_Pointer))) ? ((*(var_1_7_Pointer)) == ((float) (((10.25f + (*(var_1_8_Pointer))) + (*(var_1_9_Pointer))) + (*(var_1_10_Pointer))))) : 1)) && ((last_1_var_1_11 >= ((*(var_1_5_Pointer)) & last_1_var_1_11)) ? ((*(var_1_11_Pointer)) == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) < (((*(var_1_12_Pointer)) - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < ((*(var_1_6_Pointer)))) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : ((*(var_1_6_Pointer)))))) : (((*(var_1_12_Pointer)) - last_1_var_1_11)))))) : ((5.7 < (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)) : ((*(var_1_11_Pointer)) == ((unsigned long int) last_1_var_1_11)))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 17, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4164 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4164 mSDsluCounter, 12113 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9456 mSDsCounter, 353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4574 IncrementalHoareTripleChecker+Invalid, 4927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 353 mSolverCounterUnsat, 2657 mSDtfsCounter, 4574 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1062 GetRequests, 850 SyntacticMatches, 5 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=12, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1575 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1916 NumberOfCodeBlocks, 1916 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1988 ConstructedInterpolants, 68 QuantifiedInterpolants, 11861 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1358 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 2870/3024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 07:28:50,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-p_file-22.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:28:52,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:28:52,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:28:52,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:28:52,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:28:52,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:28:52,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:28:52,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:28:52,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:28:52,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:28:52,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:28:52,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:28:52,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:28:52,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:28:52,467 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:28:52,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:28:52,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:28:52,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:28:52,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:28:52,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:28:52,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:28:52,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:28:52,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:28:52,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:28:52,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:28:52,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:28:52,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:28:52,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:28:52,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:28:52,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:28:52,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:28:52,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:28:52,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:28:52,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:28:52,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:28:52,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:28:52,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:28:52,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:28:52,476 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:28:52,476 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:28:52,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:28:52,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:28:52,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:28:52,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:28:52,477 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 -> e6a6d08816b0ec1b4a2f12fdbffccb656cdae4ec17c704b1a7182eae79d2b0cf [2024-11-12 07:28:52,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:28:52,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:28:52,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:28:52,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:28:52,815 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:28:52,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-11-12 07:28:54,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:28:55,003 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:28:55,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-22.i [2024-11-12 07:28:55,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0455f52c2/5b917ce8f9d24d5992b28f3a0a0e1c2c/FLAGc498464f3 [2024-11-12 07:28:55,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0455f52c2/5b917ce8f9d24d5992b28f3a0a0e1c2c [2024-11-12 07:28:55,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:28:55,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:28:55,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:28:55,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:28:55,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:28:55,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e05053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55, skipping insertion in model container [2024-11-12 07:28:55,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:28:55,314 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-p_file-22.i[916,929] [2024-11-12 07:28:55,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:28:55,389 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:28:55,399 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-p_file-22.i[916,929] [2024-11-12 07:28:55,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:28:55,468 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:28:55,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55 WrapperNode [2024-11-12 07:28:55,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:28:55,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:28:55,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:28:55,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:28:55,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,526 INFO L138 Inliner]: procedures = 36, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-11-12 07:28:55,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:28:55,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:28:55,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:28:55,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:28:55,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,579 INFO L175 MemorySlicer]: Split 96 memory accesses to 11 slices as follows [2, 8, 8, 17, 16, 3, 8, 10, 8, 8, 8]. 18 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 2, 1, 1, 1, 1, 1, 3, 1]. [2024-11-12 07:28:55,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:28:55,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:28:55,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:28:55,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:28:55,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (1/1) ... [2024-11-12 07:28:55,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:28:55,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:28:55,651 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-12 07:28:55,662 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-12 07:28:55,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:28:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:28:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:28:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 07:28:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 07:28:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 07:28:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-12 07:28:55,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-12 07:28:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-12 07:28:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-12 07:28:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-12 07:28:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-12 07:28:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 07:28:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 07:28:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-12 07:28:55,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:28:55,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-12 07:28:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-12 07:28:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-12 07:28:55,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-12 07:28:55,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-12 07:28:55,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-12 07:28:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-12 07:28:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-12 07:28:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-12 07:28:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-12 07:28:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-12 07:28:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-12 07:28:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-12 07:28:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-12 07:28:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:28:55,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:28:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:28:55,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-12 07:28:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-12 07:28:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-12 07:28:55,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-12 07:28:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-12 07:28:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-12 07:28:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-12 07:28:55,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-12 07:28:55,901 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:28:55,903 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:28:57,587 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-12 07:28:57,587 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:28:57,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:28:57,604 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:28:57,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:28:57 BoogieIcfgContainer [2024-11-12 07:28:57,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:28:57,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:28:57,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:28:57,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:28:57,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:28:55" (1/3) ... [2024-11-12 07:28:57,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fd23d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:28:57, skipping insertion in model container [2024-11-12 07:28:57,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:28:55" (2/3) ... [2024-11-12 07:28:57,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fd23d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:28:57, skipping insertion in model container [2024-11-12 07:28:57,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:28:57" (3/3) ... [2024-11-12 07:28:57,642 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-22.i [2024-11-12 07:28:57,657 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:28:57,657 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:28:57,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:28:57,714 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;@3f5999db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:28:57,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:28:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:28:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 07:28:57,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:57,727 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:57,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:57,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1037497833, now seen corresponding path program 1 times [2024-11-12 07:28:57,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:28:57,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145788408] [2024-11-12 07:28:57,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:57,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:28:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:28:57,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:28:57,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:28:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:58,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:28:58,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:28:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-12 07:28:58,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:28:58,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:28:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145788408] [2024-11-12 07:28:58,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145788408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:58,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:58,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:28:58,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658832090] [2024-11-12 07:28:58,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:58,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:28:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:28:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:28:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:28:58,302 INFO L87 Difference]: Start difference. First operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:28:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:58,338 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2024-11-12 07:28:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:28:58,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-12 07:28:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:58,346 INFO L225 Difference]: With dead ends: 188 [2024-11-12 07:28:58,346 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 07:28:58,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-12 07:28:58,353 INFO L435 NwaCegarLoop]: 129 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, 129 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-12 07:28:58,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:28:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 07:28:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 07:28:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:28:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-12 07:28:58,391 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 89 [2024-11-12 07:28:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:58,392 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-12 07:28:58,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:28:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-12 07:28:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:28:58,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:58,396 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:58,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 07:28:58,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:28:58,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash -8583379, now seen corresponding path program 1 times [2024-11-12 07:28:58,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:28:58,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480371912] [2024-11-12 07:28:58,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:58,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:28:58,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:28:58,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:28:58,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:28:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:58,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:28:58,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:28:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-12 07:28:59,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:28:59,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:28:59,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480371912] [2024-11-12 07:28:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480371912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:28:59,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:28:59,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:28:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547425152] [2024-11-12 07:28:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:28:59,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:28:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:28:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:28:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:28:59,036 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:28:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:28:59,075 INFO L93 Difference]: Finished difference Result 183 states and 258 transitions. [2024-11-12 07:28:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:28:59,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-12 07:28:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:28:59,077 INFO L225 Difference]: With dead ends: 183 [2024-11-12 07:28:59,077 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 07:28:59,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 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-12 07:28:59,078 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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-12 07:28:59,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:28:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 07:28:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-12 07:28:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 07:28:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-11-12 07:28:59,086 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 92 [2024-11-12 07:28:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:28:59,087 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-11-12 07:28:59,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 07:28:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-11-12 07:28:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 07:28:59,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:28:59,089 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:28:59,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:28:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:28:59,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:28:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:28:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash -902069717, now seen corresponding path program 1 times [2024-11-12 07:28:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:28:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61829105] [2024-11-12 07:28:59,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:28:59,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:28:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:28:59,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:28:59,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 07:28:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:28:59,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 07:28:59,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:00,341 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 17 treesize of output 13 [2024-11-12 07:29:00,401 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-11-12 07:29:00,401 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 1 case distinctions, treesize of input 43 treesize of output 46 [2024-11-12 07:29:00,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 76 treesize of output 60 [2024-11-12 07:29:00,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 63 treesize of output 51 [2024-11-12 07:29:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:29:00,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:29:00,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:00,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61829105] [2024-11-12 07:29:00,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61829105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:29:00,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:29:00,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:29:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44774816] [2024-11-12 07:29:00,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:29:00,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:29:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:29:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:29:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:29:00,532 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:29:01,514 INFO L93 Difference]: Finished difference Result 551 states and 774 transitions. [2024-11-12 07:29:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:29:01,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-12 07:29:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:29:01,518 INFO L225 Difference]: With dead ends: 551 [2024-11-12 07:29:01,518 INFO L226 Difference]: Without dead ends: 460 [2024-11-12 07:29:01,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:29:01,519 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 649 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:29:01,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1700 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:29:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-12 07:29:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 446. [2024-11-12 07:29:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 395 states have (on average 1.3721518987341772) internal successors, (542), 395 states have internal predecessors, (542), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-12 07:29:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 632 transitions. [2024-11-12 07:29:01,559 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 632 transitions. Word has length 92 [2024-11-12 07:29:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:29:01,560 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 632 transitions. [2024-11-12 07:29:01,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 632 transitions. [2024-11-12 07:29:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 07:29:01,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:29:01,562 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:29:01,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 07:29:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:01,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:29:01,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:29:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash 278484247, now seen corresponding path program 1 times [2024-11-12 07:29:01,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:29:01,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533977754] [2024-11-12 07:29:01,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:01,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:01,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:29:01,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:29:01,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:29:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:02,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 07:29:02,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:02,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-11-12 07:29:02,197 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 14 treesize of output 10 [2024-11-12 07:29:02,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 15 [2024-11-12 07:29:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:29:02,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:29:02,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533977754] [2024-11-12 07:29:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533977754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:29:02,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:29:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:29:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447719922] [2024-11-12 07:29:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:29:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:29:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:29:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:29:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:29:02,225 INFO L87 Difference]: Start difference. First operand 446 states and 632 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:29:02,492 INFO L93 Difference]: Finished difference Result 810 states and 1137 transitions. [2024-11-12 07:29:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:29:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-12 07:29:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:29:02,495 INFO L225 Difference]: With dead ends: 810 [2024-11-12 07:29:02,495 INFO L226 Difference]: Without dead ends: 367 [2024-11-12 07:29:02,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:29:02,497 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 406 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:29:02,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1085 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:29:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-12 07:29:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 271. [2024-11-12 07:29:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 240 states have (on average 1.3625) internal successors, (327), 240 states have internal predecessors, (327), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:29:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2024-11-12 07:29:02,511 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 93 [2024-11-12 07:29:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:29:02,511 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2024-11-12 07:29:02,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2024-11-12 07:29:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 07:29:02,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:29:02,513 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:29:02,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 07:29:02,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:02,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:29:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:29:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1801465933, now seen corresponding path program 1 times [2024-11-12 07:29:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:29:02,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359324639] [2024-11-12 07:29:02,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:02,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:02,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:29:02,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:29:02,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:29:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:03,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:29:03,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:29:03,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:29:03,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359324639] [2024-11-12 07:29:03,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359324639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:29:03,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:29:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:29:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193701406] [2024-11-12 07:29:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:29:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:29:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:29:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:29:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:29:03,031 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:29:03,059 INFO L93 Difference]: Finished difference Result 553 states and 779 transitions. [2024-11-12 07:29:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:29:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-12 07:29:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:29:03,062 INFO L225 Difference]: With dead ends: 553 [2024-11-12 07:29:03,062 INFO L226 Difference]: Without dead ends: 285 [2024-11-12 07:29:03,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:29:03,063 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:29:03,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 248 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:29:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-12 07:29:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 199. [2024-11-12 07:29:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.353932584269663) internal successors, (241), 178 states have internal predecessors, (241), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:29:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 277 transitions. [2024-11-12 07:29:03,074 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 277 transitions. Word has length 93 [2024-11-12 07:29:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:29:03,074 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 277 transitions. [2024-11-12 07:29:03,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 277 transitions. [2024-11-12 07:29:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:29:03,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:29:03,076 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:29:03,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 07:29:03,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:03,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:29:03,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:29:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash -498818970, now seen corresponding path program 1 times [2024-11-12 07:29:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:29:03,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528189314] [2024-11-12 07:29:03,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:03,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:03,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:29:03,280 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:29:03,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:29:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:03,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:29:03,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:03,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-11-12 07:29:03,826 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 12 treesize of output 8 [2024-11-12 07:29:03,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 45 treesize of output 33 [2024-11-12 07:29:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:29:03,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:29:03,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528189314] [2024-11-12 07:29:03,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528189314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:29:03,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:29:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:29:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933970728] [2024-11-12 07:29:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:29:03,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:29:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:29:03,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:29:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:29:03,980 INFO L87 Difference]: Start difference. First operand 199 states and 277 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:29:04,289 INFO L93 Difference]: Finished difference Result 369 states and 508 transitions. [2024-11-12 07:29:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:29:04,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-12 07:29:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:29:04,290 INFO L225 Difference]: With dead ends: 369 [2024-11-12 07:29:04,290 INFO L226 Difference]: Without dead ends: 278 [2024-11-12 07:29:04,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:29:04,292 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 285 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:29:04,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 985 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:29:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-12 07:29:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 207. [2024-11-12 07:29:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 186 states have (on average 1.3548387096774193) internal successors, (252), 186 states have internal predecessors, (252), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:29:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2024-11-12 07:29:04,299 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 94 [2024-11-12 07:29:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:29:04,300 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2024-11-12 07:29:04,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2024-11-12 07:29:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:29:04,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:29:04,301 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:29:04,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 07:29:04,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:04,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:29:04,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:29:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash 393840305, now seen corresponding path program 1 times [2024-11-12 07:29:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:29:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505759923] [2024-11-12 07:29:04,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:04,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:04,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:29:04,509 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:29:04,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 07:29:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:04,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 07:29:04,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:04,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-11-12 07:29:04,975 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 14 treesize of output 10 [2024-11-12 07:29:05,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 15 [2024-11-12 07:29:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:29:05,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:29:05,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:05,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505759923] [2024-11-12 07:29:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505759923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:29:05,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:29:05,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:29:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273129583] [2024-11-12 07:29:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:29:05,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:29:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:29:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:29:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:29:05,023 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:29:05,236 INFO L93 Difference]: Finished difference Result 418 states and 576 transitions. [2024-11-12 07:29:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:29:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-12 07:29:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:29:05,238 INFO L225 Difference]: With dead ends: 418 [2024-11-12 07:29:05,238 INFO L226 Difference]: Without dead ends: 319 [2024-11-12 07:29:05,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:29:05,239 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 329 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:29:05,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1012 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:29:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-12 07:29:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 203. [2024-11-12 07:29:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.3461538461538463) internal successors, (245), 182 states have internal predecessors, (245), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:29:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 281 transitions. [2024-11-12 07:29:05,246 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 281 transitions. Word has length 94 [2024-11-12 07:29:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:29:05,246 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 281 transitions. [2024-11-12 07:29:05,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 281 transitions. [2024-11-12 07:29:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 07:29:05,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:29:05,247 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:29:05,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 07:29:05,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:05,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:29:05,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:29:05,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1228323282, now seen corresponding path program 1 times [2024-11-12 07:29:05,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:29:05,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75559518] [2024-11-12 07:29:05,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:05,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:05,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:29:05,453 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:29:05,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:29:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:05,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:29:05,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:06,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2024-11-12 07:29:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:29:06,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:29:06,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:29:06,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-12 07:29:06,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75559518] [2024-11-12 07:29:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75559518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:29:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [286995279] [2024-11-12 07:29:06,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:06,457 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:29:06,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:29:06,461 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:29:06,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-12 07:29:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:07,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 07:29:07,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:07,292 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 12 treesize of output 8 [2024-11-12 07:29:07,322 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 21 treesize of output 17 [2024-11-12 07:29:07,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 74 treesize of output 58 [2024-11-12 07:29:07,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 57 treesize of output 45 [2024-11-12 07:29:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:29:07,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:29:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [286995279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:29:07,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:29:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-12 07:29:07,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347787018] [2024-11-12 07:29:07,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:29:07,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:29:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:29:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:29:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:29:07,481 INFO L87 Difference]: Start difference. First operand 203 states and 281 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:29:08,192 INFO L93 Difference]: Finished difference Result 715 states and 992 transitions. [2024-11-12 07:29:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:29:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-12 07:29:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:29:08,194 INFO L225 Difference]: With dead ends: 715 [2024-11-12 07:29:08,194 INFO L226 Difference]: Without dead ends: 624 [2024-11-12 07:29:08,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-12 07:29:08,196 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 387 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:29:08,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1801 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:29:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-12 07:29:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 265. [2024-11-12 07:29:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.3418803418803418) internal successors, (314), 234 states have internal predecessors, (314), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:29:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 368 transitions. [2024-11-12 07:29:08,207 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 368 transitions. Word has length 95 [2024-11-12 07:29:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:29:08,207 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 368 transitions. [2024-11-12 07:29:08,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 368 transitions. [2024-11-12 07:29:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 07:29:08,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:29:08,208 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:29:08,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 07:29:08,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-12 07:29:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 07:29:08,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:29:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:29:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1362336788, now seen corresponding path program 1 times [2024-11-12 07:29:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:29:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036041184] [2024-11-12 07:29:08,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:08,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:08,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:29:08,620 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:29:08,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 07:29:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:08,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:29:08,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:08,940 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 21 treesize of output 17 [2024-11-12 07:29:08,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 54 [2024-11-12 07:29:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 54 treesize of output 42 [2024-11-12 07:29:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:29:09,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:29:09,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036041184] [2024-11-12 07:29:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036041184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:29:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:29:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:29:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029794271] [2024-11-12 07:29:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:29:09,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:29:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:29:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:29:09,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:29:09,015 INFO L87 Difference]: Start difference. First operand 265 states and 368 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:29:09,214 INFO L93 Difference]: Finished difference Result 446 states and 620 transitions. [2024-11-12 07:29:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:29:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-12 07:29:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:29:09,216 INFO L225 Difference]: With dead ends: 446 [2024-11-12 07:29:09,216 INFO L226 Difference]: Without dead ends: 355 [2024-11-12 07:29:09,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:29:09,217 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 111 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:29:09,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 640 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:29:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-12 07:29:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 217. [2024-11-12 07:29:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 196 states have (on average 1.346938775510204) internal successors, (264), 196 states have internal predecessors, (264), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:29:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 300 transitions. [2024-11-12 07:29:09,224 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 300 transitions. Word has length 95 [2024-11-12 07:29:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:29:09,225 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 300 transitions. [2024-11-12 07:29:09,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 300 transitions. [2024-11-12 07:29:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:29:09,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:29:09,225 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:29:09,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 07:29:09,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:09,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:29:09,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:29:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1584848223, now seen corresponding path program 1 times [2024-11-12 07:29:09,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:29:09,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676710618] [2024-11-12 07:29:09,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:09,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:09,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:29:09,432 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:29:09,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 07:29:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:09,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:29:09,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:10,297 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 17 treesize of output 13 [2024-11-12 07:29:10,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 27 [2024-11-12 07:29:10,337 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-12 07:29:10,337 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 1 case distinctions, treesize of input 32 treesize of output 35 [2024-11-12 07:29:10,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 17 [2024-11-12 07:29:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 07:29:10,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:29:10,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:10,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676710618] [2024-11-12 07:29:10,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676710618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:29:10,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:29:10,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:29:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757138770] [2024-11-12 07:29:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:29:10,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:29:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:29:10,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:29:10,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:29:10,382 INFO L87 Difference]: Start difference. First operand 217 states and 300 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:29:11,696 INFO L93 Difference]: Finished difference Result 415 states and 574 transitions. [2024-11-12 07:29:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:29:11,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-12 07:29:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:29:11,698 INFO L225 Difference]: With dead ends: 415 [2024-11-12 07:29:11,698 INFO L226 Difference]: Without dead ends: 310 [2024-11-12 07:29:11,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:29:11,699 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 297 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:29:11,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1007 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 07:29:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-12 07:29:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2024-11-12 07:29:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 275 states have (on average 1.3490909090909091) internal successors, (371), 275 states have internal predecessors, (371), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:29:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 425 transitions. [2024-11-12 07:29:11,714 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 425 transitions. Word has length 96 [2024-11-12 07:29:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:29:11,715 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 425 transitions. [2024-11-12 07:29:11,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 07:29:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 425 transitions. [2024-11-12 07:29:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:29:11,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:29:11,716 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:29:11,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-12 07:29:11,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:11,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:29:11,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:29:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1900772447, now seen corresponding path program 1 times [2024-11-12 07:29:11,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:29:11,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562502660] [2024-11-12 07:29:11,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:11,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:29:11,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:29:11,920 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:29:11,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 07:29:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:29:45,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 07:29:45,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:29:45,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-12 07:29:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-12 07:29:45,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:29:46,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:29:46,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-11-12 07:29:46,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:29:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562502660] [2024-11-12 07:29:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562502660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:29:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1806051329] [2024-11-12 07:29:46,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:29:46,427 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:29:46,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:29:46,430 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:29:46,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process