./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-36.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 78f51271513a16e7eca7d465f5387c94d8fad5b43cbf0af1b75f69199640eaee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:55:38,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:55:38,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:55:38,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:55:38,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:55:39,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:55:39,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:55:39,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:55:39,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:55:39,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:55:39,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:55:39,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:55:39,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:55:39,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:55:39,029 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:55:39,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:55:39,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:55:39,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:55:39,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:55:39,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:55:39,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:55:39,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:55:39,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:55:39,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:55:39,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:55:39,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:55:39,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:55:39,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:55:39,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:55:39,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:55:39,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:55:39,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:55:39,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:55:39,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:55:39,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:55:39,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:55:39,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:55:39,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:55:39,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:55:39,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:55:39,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:55:39,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:55:39,042 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 -> 78f51271513a16e7eca7d465f5387c94d8fad5b43cbf0af1b75f69199640eaee [2024-11-19 00:55:39,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:55:39,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:55:39,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:55:39,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:55:39,319 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:55:39,321 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-36.i [2024-11-19 00:55:40,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:55:41,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:55:41,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i [2024-11-19 00:55:41,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c40ac58e2/0463009cf46e4849b65931a20712f611/FLAGb2ec1229a [2024-11-19 00:55:41,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c40ac58e2/0463009cf46e4849b65931a20712f611 [2024-11-19 00:55:41,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:55:41,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:55:41,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:55:41,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:55:41,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:55:41,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a25f4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41, skipping insertion in model container [2024-11-19 00:55:41,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:55:41,285 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-36.i[916,929] [2024-11-19 00:55:41,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:55:41,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:55:41,353 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-36.i[916,929] [2024-11-19 00:55:41,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:55:41,403 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:55:41,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41 WrapperNode [2024-11-19 00:55:41,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:55:41,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:55:41,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:55:41,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:55:41,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,479 INFO L138 Inliner]: procedures = 29, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 584 [2024-11-19 00:55:41,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:55:41,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:55:41,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:55:41,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:55:41,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,550 INFO L175 MemorySlicer]: Split 133 memory accesses to 13 slices as follows [2, 9, 8, 6, 8, 11, 6, 19, 10, 16, 16, 14, 8]. 14 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1]. [2024-11-19 00:55:41,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:55:41,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:55:41,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:55:41,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:55:41,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (1/1) ... [2024-11-19 00:55:41,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:55:41,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:41,652 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-19 00:55:41,659 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-19 00:55:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:55:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:55:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:55:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:55:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:55:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:55:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:55:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:55:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 00:55:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 00:55:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 00:55:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-19 00:55:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-19 00:55:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-19 00:55:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:55:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:55:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:55:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:55:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:55:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:55:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:55:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 00:55:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 00:55:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 00:55:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 00:55:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 00:55:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 00:55:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:55:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:55:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:55:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:55:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:55:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:55:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:55:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 00:55:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:55:41,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:55:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:55:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:55:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 00:55:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 00:55:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 00:55:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 00:55:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 00:55:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 00:55:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 00:55:41,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 00:55:41,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-19 00:55:41,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:55:41,721 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 00:55:41,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 00:55:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 00:55:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 00:55:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 00:55:41,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:55:41,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:55:41,922 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:55:41,924 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:55:42,524 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-19 00:55:42,525 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:55:42,544 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:55:42,545 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:55:42,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:42 BoogieIcfgContainer [2024-11-19 00:55:42,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:55:42,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:55:42,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:55:42,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:55:42,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:55:41" (1/3) ... [2024-11-19 00:55:42,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f01519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:55:42, skipping insertion in model container [2024-11-19 00:55:42,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:41" (2/3) ... [2024-11-19 00:55:42,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f01519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:55:42, skipping insertion in model container [2024-11-19 00:55:42,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:42" (3/3) ... [2024-11-19 00:55:42,556 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-36.i [2024-11-19 00:55:42,575 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:55:42,576 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:55:42,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:55:42,674 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;@10b12942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:55:42,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:55:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 110 states have internal predecessors, (162), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:55:42,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:42,694 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:42,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:42,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:42,704 INFO L85 PathProgramCache]: Analyzing trace with hash 7050242, now seen corresponding path program 1 times [2024-11-19 00:55:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406421862] [2024-11-19 00:55:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:55:43,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:43,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406421862] [2024-11-19 00:55:43,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406421862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:55:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932154164] [2024-11-19 00:55:43,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:43,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:55:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:43,120 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-19 00:55:43,122 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-19 00:55:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:43,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:55:43,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:55:43,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932154164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:43,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:55:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:55:43,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295143062] [2024-11-19 00:55:43,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:43,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:55:43,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:55:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:55:43,583 INFO L87 Difference]: Start difference. First operand has 123 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 110 states have internal predecessors, (162), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:55:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:43,629 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2024-11-19 00:55:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:55:43,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-19 00:55:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:43,639 INFO L225 Difference]: With dead ends: 239 [2024-11-19 00:55:43,639 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 00:55:43,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-19 00:55:43,645 INFO L432 NwaCegarLoop]: 177 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, 177 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-19 00:55:43,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 00:55:43,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-19 00:55:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2024-11-19 00:55:43,683 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 109 [2024-11-19 00:55:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:43,683 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2024-11-19 00:55:43,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:55:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2024-11-19 00:55:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:55:43,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:43,688 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:43,702 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-19 00:55:43,889 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,SelfDestructingSolverStorable0 [2024-11-19 00:55:43,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:43,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1337140728, now seen corresponding path program 1 times [2024-11-19 00:55:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:43,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918439026] [2024-11-19 00:55:43,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:43,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:44,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918439026] [2024-11-19 00:55:44,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918439026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:44,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:55:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040509902] [2024-11-19 00:55:44,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:44,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:44,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:44,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:44,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:44,169 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:55:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:44,230 INFO L93 Difference]: Finished difference Result 237 states and 354 transitions. [2024-11-19 00:55:44,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:44,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-19 00:55:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:44,232 INFO L225 Difference]: With dead ends: 237 [2024-11-19 00:55:44,232 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 00:55:44,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 00:55:44,236 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 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-19 00:55:44,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 00:55:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-19 00:55:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 108 states have internal predecessors, (157), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2024-11-19 00:55:44,255 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 109 [2024-11-19 00:55:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:44,257 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2024-11-19 00:55:44,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:55:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2024-11-19 00:55:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 00:55:44,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:44,264 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:44,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:55:44,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:44,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2016412982, now seen corresponding path program 1 times [2024-11-19 00:55:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506621747] [2024-11-19 00:55:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:44,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:44,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506621747] [2024-11-19 00:55:44,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506621747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:44,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:55:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758631312] [2024-11-19 00:55:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:44,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:44,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:44,613 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:44,760 INFO L93 Difference]: Finished difference Result 358 states and 532 transitions. [2024-11-19 00:55:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:44,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-19 00:55:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:44,765 INFO L225 Difference]: With dead ends: 358 [2024-11-19 00:55:44,765 INFO L226 Difference]: Without dead ends: 240 [2024-11-19 00:55:44,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:44,769 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 191 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:44,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 485 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-19 00:55:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 212. [2024-11-19 00:55:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.4491978609625669) internal successors, (271), 187 states have internal predecessors, (271), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:55:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 315 transitions. [2024-11-19 00:55:44,803 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 315 transitions. Word has length 109 [2024-11-19 00:55:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:44,804 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 315 transitions. [2024-11-19 00:55:44,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 315 transitions. [2024-11-19 00:55:44,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:55:44,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:44,810 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:44,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:55:44,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash -31365051, now seen corresponding path program 1 times [2024-11-19 00:55:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141305091] [2024-11-19 00:55:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141305091] [2024-11-19 00:55:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141305091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:45,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:55:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028935898] [2024-11-19 00:55:45,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:45,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:45,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:45,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:45,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:45,139 INFO L87 Difference]: Start difference. First operand 212 states and 315 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:45,200 INFO L93 Difference]: Finished difference Result 492 states and 737 transitions. [2024-11-19 00:55:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:45,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-19 00:55:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:45,204 INFO L225 Difference]: With dead ends: 492 [2024-11-19 00:55:45,205 INFO L226 Difference]: Without dead ends: 362 [2024-11-19 00:55:45,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:45,208 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 126 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:45,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 491 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-19 00:55:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2024-11-19 00:55:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 321 states have (on average 1.4672897196261683) internal successors, (471), 321 states have internal predecessors, (471), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:55:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 537 transitions. [2024-11-19 00:55:45,247 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 537 transitions. Word has length 110 [2024-11-19 00:55:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:45,248 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 537 transitions. [2024-11-19 00:55:45,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 537 transitions. [2024-11-19 00:55:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:55:45,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:45,250 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:45,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:55:45,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:45,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1311228729, now seen corresponding path program 1 times [2024-11-19 00:55:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:45,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435324791] [2024-11-19 00:55:45,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:45,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:45,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435324791] [2024-11-19 00:55:45,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435324791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:45,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:45,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:55:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094185274] [2024-11-19 00:55:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:45,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:45,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:45,553 INFO L87 Difference]: Start difference. First operand 358 states and 537 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:45,627 INFO L93 Difference]: Finished difference Result 600 states and 898 transitions. [2024-11-19 00:55:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:45,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-19 00:55:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:45,631 INFO L225 Difference]: With dead ends: 600 [2024-11-19 00:55:45,632 INFO L226 Difference]: Without dead ends: 364 [2024-11-19 00:55:45,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:45,634 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 123 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:45,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 491 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-19 00:55:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2024-11-19 00:55:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 323 states have (on average 1.4643962848297214) internal successors, (473), 323 states have internal predecessors, (473), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:55:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 539 transitions. [2024-11-19 00:55:45,657 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 539 transitions. Word has length 110 [2024-11-19 00:55:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:45,657 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 539 transitions. [2024-11-19 00:55:45,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 539 transitions. [2024-11-19 00:55:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:55:45,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:45,659 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:45,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:55:45,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:45,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1053063291, now seen corresponding path program 1 times [2024-11-19 00:55:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:45,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577660436] [2024-11-19 00:55:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:45,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:46,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:55:46,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577660436] [2024-11-19 00:55:46,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577660436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:46,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:46,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:55:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267278371] [2024-11-19 00:55:46,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:46,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:55:46,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:46,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:46,180 INFO L87 Difference]: Start difference. First operand 360 states and 539 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:46,291 INFO L93 Difference]: Finished difference Result 832 states and 1241 transitions. [2024-11-19 00:55:46,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:46,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-19 00:55:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:46,295 INFO L225 Difference]: With dead ends: 832 [2024-11-19 00:55:46,296 INFO L226 Difference]: Without dead ends: 598 [2024-11-19 00:55:46,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:55:46,297 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 150 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:46,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 734 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-19 00:55:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 380. [2024-11-19 00:55:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 343 states have (on average 1.4606413994169096) internal successors, (501), 343 states have internal predecessors, (501), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:55:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 567 transitions. [2024-11-19 00:55:46,320 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 567 transitions. Word has length 110 [2024-11-19 00:55:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:46,321 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 567 transitions. [2024-11-19 00:55:46,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 567 transitions. [2024-11-19 00:55:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 00:55:46,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:46,323 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:46,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:55:46,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:46,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1887774705, now seen corresponding path program 1 times [2024-11-19 00:55:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:55:46,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721711900] [2024-11-19 00:55:46,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:55:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:55:46,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:55:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:55:46,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:55:46,508 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:55:46,509 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:55:46,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:55:46,515 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:55:46,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:55:46,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:55:46 BoogieIcfgContainer [2024-11-19 00:55:46,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:55:46,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:55:46,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:55:46,706 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:55:46,706 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:42" (3/4) ... [2024-11-19 00:55:46,708 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:55:46,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:55:46,710 INFO L158 Benchmark]: Toolchain (without parser) took 5639.36ms. Allocated memory was 153.1MB in the beginning and 251.7MB in the end (delta: 98.6MB). Free memory was 122.6MB in the beginning and 198.3MB in the end (delta: -75.7MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-19 00:55:46,710 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory was 111.1MB in the beginning and 111.0MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:55:46,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.28ms. Allocated memory is still 153.1MB. Free memory was 122.6MB in the beginning and 106.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:55:46,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.02ms. Allocated memory is still 153.1MB. Free memory was 106.5MB in the beginning and 102.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:55:46,711 INFO L158 Benchmark]: Boogie Preprocessor took 127.87ms. Allocated memory is still 153.1MB. Free memory was 102.8MB in the beginning and 97.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:55:46,711 INFO L158 Benchmark]: RCFGBuilder took 932.91ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 51.5MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-19 00:55:46,712 INFO L158 Benchmark]: TraceAbstraction took 4156.53ms. Allocated memory was 153.1MB in the beginning and 251.7MB in the end (delta: 98.6MB). Free memory was 50.9MB in the beginning and 199.3MB in the end (delta: -148.4MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2024-11-19 00:55:46,712 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 251.7MB. Free memory was 199.3MB in the beginning and 198.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:55:46,713 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.20ms. Allocated memory is still 153.1MB. Free memory was 111.1MB in the beginning and 111.0MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.28ms. Allocated memory is still 153.1MB. Free memory was 122.6MB in the beginning and 106.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.02ms. Allocated memory is still 153.1MB. Free memory was 106.5MB in the beginning and 102.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.87ms. Allocated memory is still 153.1MB. Free memory was 102.8MB in the beginning and 97.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 932.91ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 51.5MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4156.53ms. Allocated memory was 153.1MB in the beginning and 251.7MB in the end (delta: 98.6MB). Free memory was 50.9MB in the beginning and 199.3MB in the end (delta: -148.4MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 251.7MB. Free memory was 199.3MB in the beginning and 198.3MB 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 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of shiftRight at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L22] unsigned long int var_1_1 = 1; [L23] unsigned long int* var_1_1_Pointer = &(var_1_1); [L24] float var_1_3 = 9999999999.875; [L24] float var_1_3 = 9999999999.875; [L25] float* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_4 = 0; [L26] unsigned char var_1_4 = 0; [L27] unsigned char* var_1_4_Pointer = &(var_1_4); [L28] float var_1_5 = 4.25; [L28] float var_1_5 = 4.25; [L29] float* var_1_5_Pointer = &(var_1_5); [L30] unsigned char var_1_7 = 1; [L30] unsigned char var_1_7 = 1; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_9 = 1; [L32] unsigned char var_1_9 = 1; [L33] unsigned char* var_1_9_Pointer = &(var_1_9); [L34] double var_1_10 = 64.2; [L34] double var_1_10 = 64.2; [L35] double* var_1_10_Pointer = &(var_1_10); [L36] double var_1_11 = 9.5; [L36] double var_1_11 = 9.5; [L37] double* var_1_11_Pointer = &(var_1_11); [L38] double var_1_12 = 199.5; [L38] double var_1_12 = 199.5; [L39] double* var_1_12_Pointer = &(var_1_12); [L40] double var_1_13 = 3.5; [L40] double var_1_13 = 3.5; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 1; [L42] unsigned char var_1_14 = 1; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_16 = 2; [L44] unsigned char var_1_16 = 2; [L45] unsigned char* var_1_16_Pointer = &(var_1_16); [L46] unsigned char last_1_var_1_14 = 1; VAL [isInitial=0, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR \read(var_1_14) [L104] last_1_var_1_14 = var_1_14 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L83] var_1_3 = __VERIFIER_nondet_float() [L84] EXPR \read(var_1_3) [L84] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L84] EXPR \read(var_1_3) [L84] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] var_1_4 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] var_1_5 = __VERIFIER_nondet_float() [L89] EXPR \read(var_1_5) [L89] EXPR var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] EXPR var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F [L89] EXPR \read(var_1_5) [L89] EXPR var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] EXPR (var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] EXPR (var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] var_1_9 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_11) [L94] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L94] EXPR \read(var_1_11) [L94] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L98] EXPR \read(var_1_13) [L98] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] var_1_16 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L115] RET updateVariables() [L116] CALL step() [L50] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] COND FALSE !((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) [L53] EXPR \read(*var_1_13_Pointer) [L53] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L53] COND FALSE !((*(var_1_13_Pointer)) == (- (*(var_1_12_Pointer)))) [L60] (*(var_1_14_Pointer)) = 0 VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L62] EXPR \read(*var_1_5_Pointer) [L62] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L62] COND TRUE (*(var_1_5_Pointer)) > (*(var_1_3_Pointer)) [L63] (*(var_1_10_Pointer)) = 4.6 VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L67] EXPR \read(*var_1_10_Pointer) [L67] EXPR \read(*var_1_10_Pointer) [L67] unsigned char stepLocal_0 = (*(var_1_10_Pointer)) > (*(var_1_10_Pointer)); [L68] stepLocal_0 && (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L68] stepLocal_0 && (*(var_1_7_Pointer)) [L68] EXPR \read(*var_1_7_Pointer) [L68] stepLocal_0 && (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L68] COND TRUE stepLocal_0 && (*(var_1_7_Pointer)) [L69] EXPR \read(*var_1_10_Pointer) [L69] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L69] EXPR (((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))) [L69] EXPR \read(*var_1_10_Pointer) [L69] EXPR (((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L69] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L69] COND TRUE (((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer)) [L70] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L70] COND TRUE (*(var_1_7_Pointer)) [L71] (*(var_1_1_Pointer)) = 10u VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR \read(*var_1_10_Pointer) [L107] EXPR \read(*var_1_10_Pointer) [L107] EXPR ((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] EXPR ((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] EXPR (((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) [L107] EXPR \read(*var_1_1_Pointer) [L107] EXPR \read(*var_1_14_Pointer) [L107] EXPR (((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] EXPR ((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] EXPR ((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] EXPR (((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1)) && (((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((double) 4.6)) : ((*(var_1_10_Pointer)) == ((double) (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))))))) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] EXPR (((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1)) && (((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((double) 4.6)) : ((*(var_1_10_Pointer)) == ((double) (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))))))) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] EXPR ((((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1)) && (((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((double) 4.6)) : ((*(var_1_10_Pointer)) == ((double) (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))))))) && (((*(var_1_13_Pointer)) == (- (*(var_1_12_Pointer)))) ? (((*(var_1_7_Pointer)) && (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) : ((*(var_1_14_Pointer)) == ((unsigned char) 0))) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] EXPR ((((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1)) && (((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((double) 4.6)) : ((*(var_1_10_Pointer)) == ((double) (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))))))) && (((*(var_1_13_Pointer)) == (- (*(var_1_12_Pointer)))) ? (((*(var_1_7_Pointer)) && (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) : ((*(var_1_14_Pointer)) == ((unsigned char) 0))) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107-L108] return ((((((*(var_1_10_Pointer)) > (*(var_1_10_Pointer))) && (*(var_1_7_Pointer))) ? (((((((*(var_1_10_Pointer))) > ((- (*(var_1_10_Pointer))))) ? ((*(var_1_10_Pointer))) : ((- (*(var_1_10_Pointer)))))) != (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_9_Pointer))))) : 1)) && (((*(var_1_5_Pointer)) > (*(var_1_3_Pointer))) ? ((*(var_1_10_Pointer)) == ((double) 4.6)) : ((*(var_1_10_Pointer)) == ((double) (((((*(var_1_11_Pointer))) > ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_11_Pointer))) : ((((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))))))) && (((*(var_1_13_Pointer)) == (- (*(var_1_12_Pointer)))) ? (((*(var_1_7_Pointer)) && (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) : ((*(var_1_14_Pointer)) == ((unsigned char) 0))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 590 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 2892 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1846 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 1046 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 254 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 880 NumberOfCodeBlocks, 880 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 1528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1520/1540 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-19 00:55:46,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-36.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 78f51271513a16e7eca7d465f5387c94d8fad5b43cbf0af1b75f69199640eaee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:55:48,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:55:49,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:55:49,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:55:49,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:55:49,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:55:49,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:55:49,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:55:49,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:55:49,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:55:49,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:55:49,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:55:49,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:55:49,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:55:49,065 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:55:49,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:55:49,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:55:49,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:55:49,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:55:49,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:55:49,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:55:49,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:55:49,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:55:49,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:55:49,073 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:55:49,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:55:49,074 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:55:49,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:55:49,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:55:49,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:55:49,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:55:49,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:55:49,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:55:49,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:55:49,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:55:49,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:55:49,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:55:49,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:55:49,079 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:55:49,079 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:55:49,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:55:49,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:55:49,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:55:49,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:55:49,080 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 -> 78f51271513a16e7eca7d465f5387c94d8fad5b43cbf0af1b75f69199640eaee [2024-11-19 00:55:49,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:55:49,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:55:49,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:55:49,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:55:49,440 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:55:49,441 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-36.i [2024-11-19 00:55:50,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:55:51,202 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:55:51,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-36.i [2024-11-19 00:55:51,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d792b42/0cc9b4c8725c4215aac02b5967d4e38a/FLAG3f1a7a0a2 [2024-11-19 00:55:51,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d792b42/0cc9b4c8725c4215aac02b5967d4e38a [2024-11-19 00:55:51,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:55:51,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:55:51,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:55:51,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:55:51,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:55:51,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3905c64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51, skipping insertion in model container [2024-11-19 00:55:51,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:55:51,484 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-36.i[916,929] [2024-11-19 00:55:51,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:55:51,580 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:55:51,592 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-36.i[916,929] [2024-11-19 00:55:51,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:55:51,659 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:55:51,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51 WrapperNode [2024-11-19 00:55:51,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:55:51,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:55:51,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:55:51,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:55:51,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,737 INFO L138 Inliner]: procedures = 36, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 570 [2024-11-19 00:55:51,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:55:51,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:55:51,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:55:51,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:55:51,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,788 INFO L175 MemorySlicer]: Split 133 memory accesses to 13 slices as follows [2, 9, 8, 6, 8, 11, 6, 19, 10, 16, 16, 14, 8]. 14 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1]. [2024-11-19 00:55:51,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:55:51,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:55:51,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:55:51,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:55:51,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (1/1) ... [2024-11-19 00:55:51,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:55:51,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:55:51,926 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-19 00:55:51,929 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-19 00:55:51,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:55:51,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:55:51,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:55:51,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:55:51,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:55:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:55:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:55:51,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-19 00:55:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-19 00:55:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-19 00:55:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-19 00:55:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-19 00:55:51,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-19 00:55:51,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-19 00:55:51,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:55:51,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:55:51,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:55:51,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:55:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:55:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:55:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-19 00:55:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-19 00:55:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-19 00:55:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-19 00:55:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-19 00:55:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-19 00:55:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-19 00:55:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:55:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:55:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:55:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:55:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:55:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:55:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:55:51,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 00:55:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 00:55:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 00:55:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 00:55:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 00:55:51,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 00:55:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:55:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:55:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:55:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:55:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 00:55:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 00:55:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-19 00:55:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-19 00:55:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-19 00:55:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:55:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:55:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:55:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:55:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:55:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:55:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 00:55:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-19 00:55:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-19 00:55:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-19 00:55:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-19 00:55:51,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-19 00:55:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-19 00:55:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:55:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:55:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:55:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:55:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:55:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:55:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-19 00:55:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-19 00:55:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-19 00:55:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-19 00:55:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-19 00:55:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-19 00:55:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-19 00:55:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:55:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:55:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:55:51,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:55:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:55:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:55:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 00:55:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-19 00:55:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-19 00:55:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-19 00:55:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-19 00:55:51,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-19 00:55:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-19 00:55:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:55:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:55:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:55:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:55:51,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:55:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:55:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 00:55:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-19 00:55:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-19 00:55:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-19 00:55:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-19 00:55:51,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-19 00:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-19 00:55:51,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:55:51,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:55:51,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:55:51,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:55:51,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:55:51,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:55:51,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:55:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:55:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:55:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 00:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 00:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 00:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 00:55:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 00:55:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 00:55:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:55:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:55:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:55:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:55:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:55:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:55:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 00:55:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-19 00:55:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-19 00:55:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-19 00:55:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-19 00:55:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-19 00:55:52,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-19 00:55:52,253 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:55:52,255 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:55:53,220 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-11-19 00:55:53,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:55:53,239 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:55:53,239 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:55:53,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:53 BoogieIcfgContainer [2024-11-19 00:55:53,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:55:53,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:55:53,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:55:53,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:55:53,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:55:51" (1/3) ... [2024-11-19 00:55:53,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1573ccdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:55:53, skipping insertion in model container [2024-11-19 00:55:53,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:55:51" (2/3) ... [2024-11-19 00:55:53,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1573ccdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:55:53, skipping insertion in model container [2024-11-19 00:55:53,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:55:53" (3/3) ... [2024-11-19 00:55:53,249 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-36.i [2024-11-19 00:55:53,266 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:55:53,266 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:55:53,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:55:53,338 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;@2c19c90a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:55:53,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:55:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:55:53,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:53,358 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:53,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash 91120692, now seen corresponding path program 1 times [2024-11-19 00:55:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775840015] [2024-11-19 00:55:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:53,380 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-19 00:55:53,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:53,382 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-19 00:55:53,401 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-19 00:55:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:53,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:55:53,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 00:55:53,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:53,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:55:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775840015] [2024-11-19 00:55:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775840015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:53,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:55:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521527531] [2024-11-19 00:55:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:53,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:55:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:55:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:55:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:55:53,958 INFO L87 Difference]: Start difference. First operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:55:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:53,996 INFO L93 Difference]: Finished difference Result 227 states and 355 transitions. [2024-11-19 00:55:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:55:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-19 00:55:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:54,007 INFO L225 Difference]: With dead ends: 227 [2024-11-19 00:55:54,008 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:55:54,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-19 00:55:54,016 INFO L432 NwaCegarLoop]: 163 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, 163 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-19 00:55:54,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:55:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 00:55:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-11-19 00:55:54,057 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 108 [2024-11-19 00:55:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:54,057 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-11-19 00:55:54,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:55:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-11-19 00:55:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:55:54,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:54,060 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:54,070 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-19 00:55:54,263 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-19 00:55:54,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:54,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1156138350, now seen corresponding path program 1 times [2024-11-19 00:55:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:54,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836854260] [2024-11-19 00:55:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:54,266 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-19 00:55:54,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:54,269 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-19 00:55:54,270 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-19 00:55:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:54,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:55:54,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:55:54,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:54,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:55:54,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836854260] [2024-11-19 00:55:54,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836854260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:54,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:54,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:55:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453837420] [2024-11-19 00:55:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:55:54,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:54,766 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:55:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:54,871 INFO L93 Difference]: Finished difference Result 221 states and 326 transitions. [2024-11-19 00:55:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-19 00:55:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:54,873 INFO L225 Difference]: With dead ends: 221 [2024-11-19 00:55:54,874 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 00:55:54,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 105 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-19 00:55:54,875 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:54,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 00:55:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-19 00:55:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-11-19 00:55:54,896 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 108 [2024-11-19 00:55:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:54,898 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-11-19 00:55:54,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:55:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-11-19 00:55:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:55:54,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:54,904 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:54,915 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 (3)] Ended with exit code 0 [2024-11-19 00:55:55,104 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-19 00:55:55,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:55,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash -805436308, now seen corresponding path program 1 times [2024-11-19 00:55:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:55,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447546077] [2024-11-19 00:55:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:55,107 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-19 00:55:55,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:55,110 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-19 00:55:55,111 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-19 00:55:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:55,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:55:55,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:55,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:55:55,602 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 184 treesize of output 64 [2024-11-19 00:55:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:55,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:55,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:55:55,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447546077] [2024-11-19 00:55:55,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447546077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:55,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:55,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:55:55,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019180073] [2024-11-19 00:55:55,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:55,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:55:55,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:55:55,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:55:55,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:55:55,628 INFO L87 Difference]: Start difference. First operand 113 states and 165 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:56,013 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-11-19 00:55:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:55:56,018 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-19 00:55:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:56,020 INFO L225 Difference]: With dead ends: 219 [2024-11-19 00:55:56,020 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 00:55:56,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 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-19 00:55:56,022 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:56,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:55:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 00:55:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-19 00:55:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-19 00:55:56,033 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 108 [2024-11-19 00:55:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:56,035 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-19 00:55:56,035 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-19 00:55:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:55:56,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:56,037 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:56,047 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-19 00:55:56,240 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-19 00:55:56,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:56,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2085299986, now seen corresponding path program 1 times [2024-11-19 00:55:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730547900] [2024-11-19 00:55:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:56,242 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-19 00:55:56,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:56,244 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-19 00:55:56,245 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-19 00:55:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:56,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:55:56,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:56,916 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 32 treesize of output 20 [2024-11-19 00:55:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:56,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:56,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:55:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730547900] [2024-11-19 00:55:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730547900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:56,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:55:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122156017] [2024-11-19 00:55:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:56,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:55:56,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:55:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:55:56,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:55:56,928 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:57,157 INFO L93 Difference]: Finished difference Result 216 states and 311 transitions. [2024-11-19 00:55:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:55:57,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-19 00:55:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:57,160 INFO L225 Difference]: With dead ends: 216 [2024-11-19 00:55:57,160 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 00:55:57,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:57,165 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 89 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:57,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:55:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 00:55:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 00:55:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2024-11-19 00:55:57,184 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 108 [2024-11-19 00:55:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:57,185 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2024-11-19 00:55:57,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2024-11-19 00:55:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:55:57,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:57,190 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:57,203 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-19 00:55:57,391 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-19 00:55:57,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:57,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1827134548, now seen corresponding path program 1 times [2024-11-19 00:55:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879117079] [2024-11-19 00:55:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:57,393 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-19 00:55:57,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:57,396 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-19 00:55:57,397 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-19 00:55:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:57,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:55:57,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:57,795 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-19 00:55:57,815 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-19 00:55:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:57,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:57,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:55:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879117079] [2024-11-19 00:55:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879117079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:57,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:55:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721114115] [2024-11-19 00:55:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:57,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:55:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:55:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:55:57,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:55:57,871 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:58,105 INFO L93 Difference]: Finished difference Result 336 states and 482 transitions. [2024-11-19 00:55:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:55:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-19 00:55:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:58,107 INFO L225 Difference]: With dead ends: 336 [2024-11-19 00:55:58,108 INFO L226 Difference]: Without dead ends: 229 [2024-11-19 00:55:58,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:55:58,111 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 268 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:58,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 867 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:55:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-19 00:55:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 125. [2024-11-19 00:55:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 178 transitions. [2024-11-19 00:55:58,130 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 178 transitions. Word has length 108 [2024-11-19 00:55:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:58,130 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 178 transitions. [2024-11-19 00:55:58,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 178 transitions. [2024-11-19 00:55:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:55:58,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:58,136 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:58,153 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-19 00:55:58,336 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-19 00:55:58,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:58,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1115889186, now seen corresponding path program 1 times [2024-11-19 00:55:58,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:58,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949554988] [2024-11-19 00:55:58,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:58,338 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-19 00:55:58,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:58,340 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-19 00:55:58,343 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-19 00:55:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:58,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:55:58,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:58,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:58,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:55:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949554988] [2024-11-19 00:55:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949554988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:55:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423984431] [2024-11-19 00:55:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:55:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:58,706 INFO L87 Difference]: Start difference. First operand 125 states and 178 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:58,741 INFO L93 Difference]: Finished difference Result 249 states and 356 transitions. [2024-11-19 00:55:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-19 00:55:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:58,742 INFO L225 Difference]: With dead ends: 249 [2024-11-19 00:55:58,743 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 00:55:58,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:58,744 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:58,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:55:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 00:55:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-19 00:55:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 114 states have internal predecessors, (158), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2024-11-19 00:55:58,764 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 110 [2024-11-19 00:55:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:58,765 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2024-11-19 00:55:58,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2024-11-19 00:55:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:55:58,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:58,766 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:58,778 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-19 00:55:58,967 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-19 00:55:58,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:58,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1936376764, now seen corresponding path program 1 times [2024-11-19 00:55:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:58,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972669742] [2024-11-19 00:55:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:58,969 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-19 00:55:58,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:58,972 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-19 00:55:58,973 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-19 00:55:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:55:59,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:55:59,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:55:59,330 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-19 00:55:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:55:59,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:55:59,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:55:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972669742] [2024-11-19 00:55:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972669742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:55:59,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:55:59,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:55:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570926445] [2024-11-19 00:55:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:55:59,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:55:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:55:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:55:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:55:59,367 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:55:59,462 INFO L93 Difference]: Finished difference Result 253 states and 360 transitions. [2024-11-19 00:55:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:55:59,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-19 00:55:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:55:59,464 INFO L225 Difference]: With dead ends: 253 [2024-11-19 00:55:59,464 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 00:55:59,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:55:59,466 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 136 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:55:59,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 426 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:55:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 00:55:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2024-11-19 00:55:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:55:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2024-11-19 00:55:59,474 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 110 [2024-11-19 00:55:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:55:59,475 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2024-11-19 00:55:59,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:55:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-11-19 00:55:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:55:59,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:55:59,478 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:55:59,492 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 (8)] Forceful destruction successful, exit code 0 [2024-11-19 00:55:59,679 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-19 00:55:59,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:55:59,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:55:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1613948509, now seen corresponding path program 1 times [2024-11-19 00:55:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:55:59,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433814769] [2024-11-19 00:55:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:55:59,681 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-19 00:55:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:55:59,683 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-19 00:55:59,684 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-19 00:56:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:00,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:56:00,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:00,066 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-19 00:56:00,090 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-19 00:56:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:00,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:00,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433814769] [2024-11-19 00:56:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433814769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:00,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:56:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902704725] [2024-11-19 00:56:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:00,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:56:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:56:00,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:00,183 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:00,397 INFO L93 Difference]: Finished difference Result 349 states and 495 transitions. [2024-11-19 00:56:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:00,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-19 00:56:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:00,399 INFO L225 Difference]: With dead ends: 349 [2024-11-19 00:56:00,399 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 00:56:00,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:00,400 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 154 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:00,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1226 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 00:56:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 132. [2024-11-19 00:56:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.3865546218487395) internal successors, (165), 119 states have internal predecessors, (165), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:56:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2024-11-19 00:56:00,414 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 112 [2024-11-19 00:56:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2024-11-19 00:56:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2024-11-19 00:56:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:56:00,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:00,416 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:00,428 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 (9)] Ended with exit code 0 [2024-11-19 00:56:00,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 [2024-11-19 00:56:00,617 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash -49787367, now seen corresponding path program 1 times [2024-11-19 00:56:00,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:00,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135667139] [2024-11-19 00:56:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:00,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-19 00:56:00,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:00,621 INFO L229 MonitoredProcess]: Starting monitored process 10 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-19 00:56:00,624 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 (10)] Waiting until timeout for monitored process [2024-11-19 00:56:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:01,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:56:01,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:01,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 00:56:01,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 00:56:01,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:01,444 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 123 treesize of output 53 [2024-11-19 00:56:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:01,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:01,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135667139] [2024-11-19 00:56:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135667139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:01,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:01,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:56:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399585588] [2024-11-19 00:56:01,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:56:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:56:01,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:01,479 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:03,122 INFO L93 Difference]: Finished difference Result 393 states and 559 transitions. [2024-11-19 00:56:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:03,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-19 00:56:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:03,124 INFO L225 Difference]: With dead ends: 393 [2024-11-19 00:56:03,124 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 00:56:03,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:03,125 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 232 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:03,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 881 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 00:56:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 00:56:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 170. [2024-11-19 00:56:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 157 states have (on average 1.3694267515923566) internal successors, (215), 157 states have internal predecessors, (215), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:56:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 237 transitions. [2024-11-19 00:56:03,138 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 237 transitions. Word has length 112 [2024-11-19 00:56:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:03,138 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 237 transitions. [2024-11-19 00:56:03,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 237 transitions. [2024-11-19 00:56:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 00:56:03,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:03,147 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:03,160 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:03,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-19 00:56:03,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:03,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash -763715422, now seen corresponding path program 1 times [2024-11-19 00:56:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:03,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314449344] [2024-11-19 00:56:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:03,350 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-19 00:56:03,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:03,351 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-19 00:56:03,353 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-19 00:56:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:03,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:56:03,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:03,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 00:56:03,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 00:56:03,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:03,981 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 200 treesize of output 70 [2024-11-19 00:56:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:03,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:03,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314449344] [2024-11-19 00:56:03,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314449344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:03,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:03,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:56:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24704970] [2024-11-19 00:56:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:03,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:03,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:03,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:03,996 INFO L87 Difference]: Start difference. First operand 170 states and 237 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:04,455 INFO L93 Difference]: Finished difference Result 399 states and 562 transitions. [2024-11-19 00:56:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:56:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-19 00:56:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:04,457 INFO L225 Difference]: With dead ends: 399 [2024-11-19 00:56:04,457 INFO L226 Difference]: Without dead ends: 232 [2024-11-19 00:56:04,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:04,458 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 233 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:04,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 490 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:56:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-19 00:56:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 119. [2024-11-19 00:56:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 106 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:56:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2024-11-19 00:56:04,473 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 114 [2024-11-19 00:56:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:04,473 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2024-11-19 00:56:04,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2024-11-19 00:56:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 00:56:04,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:04,475 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:04,487 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:04,675 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-19 00:56:04,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1171277797, now seen corresponding path program 1 times [2024-11-19 00:56:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636472918] [2024-11-19 00:56:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:04,677 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-19 00:56:04,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:04,680 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-19 00:56:04,681 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-19 00:56:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:05,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:56:05,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:05,022 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-19 00:56:05,062 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 37 treesize of output 25 [2024-11-19 00:56:05,100 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:05,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:05,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:05,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636472918] [2024-11-19 00:56:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636472918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:56:05,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967959260] [2024-11-19 00:56:05,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:05,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:56:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:05,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:56:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:05,102 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:06,239 INFO L93 Difference]: Finished difference Result 241 states and 323 transitions. [2024-11-19 00:56:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:06,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-19 00:56:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:06,241 INFO L225 Difference]: With dead ends: 241 [2024-11-19 00:56:06,241 INFO L226 Difference]: Without dead ends: 239 [2024-11-19 00:56:06,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:06,242 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 121 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:06,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1197 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 00:56:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-19 00:56:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2024-11-19 00:56:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:56:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2024-11-19 00:56:06,254 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 114 [2024-11-19 00:56:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:06,255 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2024-11-19 00:56:06,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2024-11-19 00:56:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:56:06,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:06,257 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:06,268 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 (12)] Ended with exit code 0 [2024-11-19 00:56:06,457 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-19 00:56:06,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:06,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1421844337, now seen corresponding path program 1 times [2024-11-19 00:56:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:06,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309817848] [2024-11-19 00:56:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:06,459 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-19 00:56:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:06,460 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-19 00:56:06,461 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-19 00:56:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:06,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:56:06,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:07,695 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 61 treesize of output 37 [2024-11-19 00:56:07,698 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 97 treesize of output 49 [2024-11-19 00:56:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:07,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:07,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:07,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309817848] [2024-11-19 00:56:07,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309817848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:07,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:07,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:56:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681259065] [2024-11-19 00:56:07,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:07,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:07,792 INFO L87 Difference]: Start difference. First operand 168 states and 220 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:09,143 INFO L93 Difference]: Finished difference Result 513 states and 671 transitions. [2024-11-19 00:56:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:56:09,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-19 00:56:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:09,148 INFO L225 Difference]: With dead ends: 513 [2024-11-19 00:56:09,148 INFO L226 Difference]: Without dead ends: 348 [2024-11-19 00:56:09,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:56:09,149 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 387 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:09,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 767 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:56:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-19 00:56:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 254. [2024-11-19 00:56:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 229 states have (on average 1.2663755458515285) internal successors, (290), 229 states have internal predecessors, (290), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:56:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 334 transitions. [2024-11-19 00:56:09,189 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 334 transitions. Word has length 115 [2024-11-19 00:56:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:09,189 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 334 transitions. [2024-11-19 00:56:09,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 334 transitions. [2024-11-19 00:56:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:56:09,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:09,191 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:09,205 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 (13)] Ended with exit code 0 [2024-11-19 00:56:09,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-19 00:56:09,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:09,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash -425514710, now seen corresponding path program 1 times [2024-11-19 00:56:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577253316] [2024-11-19 00:56:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:09,395 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-19 00:56:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:09,396 INFO L229 MonitoredProcess]: Starting monitored process 14 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-19 00:56:09,397 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 (14)] Waiting until timeout for monitored process [2024-11-19 00:56:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:09,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 00:56:09,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:10,543 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 62 treesize of output 38 [2024-11-19 00:56:10,547 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 98 treesize of output 50 [2024-11-19 00:56:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:10,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:10,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:10,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577253316] [2024-11-19 00:56:10,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577253316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:10,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:10,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:56:10,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044647464] [2024-11-19 00:56:10,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:10,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:10,608 INFO L87 Difference]: Start difference. First operand 254 states and 334 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:11,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:11,874 INFO L93 Difference]: Finished difference Result 599 states and 783 transitions. [2024-11-19 00:56:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:56:11,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-19 00:56:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:11,879 INFO L225 Difference]: With dead ends: 599 [2024-11-19 00:56:11,879 INFO L226 Difference]: Without dead ends: 348 [2024-11-19 00:56:11,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:56:11,885 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 353 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:11,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 897 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:56:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-19 00:56:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 290. [2024-11-19 00:56:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 265 states have (on average 1.2528301886792452) internal successors, (332), 265 states have internal predecessors, (332), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:56:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 376 transitions. [2024-11-19 00:56:11,911 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 376 transitions. Word has length 115 [2024-11-19 00:56:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:11,911 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 376 transitions. [2024-11-19 00:56:11,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 376 transitions. [2024-11-19 00:56:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:56:11,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:11,913 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:11,925 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 (14)] Ended with exit code 0 [2024-11-19 00:56:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-19 00:56:12,114 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:12,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash 741772237, now seen corresponding path program 1 times [2024-11-19 00:56:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724688956] [2024-11-19 00:56:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:12,116 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-19 00:56:12,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:12,120 INFO L229 MonitoredProcess]: Starting monitored process 15 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-19 00:56:12,121 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 (15)] Waiting until timeout for monitored process [2024-11-19 00:56:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:12,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:56:12,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:12,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:12,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724688956] [2024-11-19 00:56:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724688956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:12,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:56:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805524002] [2024-11-19 00:56:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:12,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:56:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:56:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:56:12,451 INFO L87 Difference]: Start difference. First operand 290 states and 376 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:12,496 INFO L93 Difference]: Finished difference Result 577 states and 749 transitions. [2024-11-19 00:56:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:56:12,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-19 00:56:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:12,498 INFO L225 Difference]: With dead ends: 577 [2024-11-19 00:56:12,498 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 00:56:12,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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-19 00:56:12,499 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:12,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 00:56:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-19 00:56:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 265 states have (on average 1.2490566037735849) internal successors, (331), 265 states have internal predecessors, (331), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:56:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 375 transitions. [2024-11-19 00:56:12,524 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 375 transitions. Word has length 115 [2024-11-19 00:56:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:12,524 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 375 transitions. [2024-11-19 00:56:12,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 375 transitions. [2024-11-19 00:56:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 00:56:12,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:12,526 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:12,536 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-19 00:56:12,727 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:12,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1808699005, now seen corresponding path program 1 times [2024-11-19 00:56:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918224504] [2024-11-19 00:56:12,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:12,728 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-19 00:56:12,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:12,729 INFO L229 MonitoredProcess]: Starting monitored process 16 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-19 00:56:12,730 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 (16)] Waiting until timeout for monitored process [2024-11-19 00:56:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:13,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:56:13,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:14,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:14,776 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 146 treesize of output 56 [2024-11-19 00:56:14,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:14,789 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 96 treesize of output 36 [2024-11-19 00:56:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 00:56:14,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:15,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:15,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 129 [2024-11-19 00:56:18,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918224504] [2024-11-19 00:56:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918224504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1053113317] [2024-11-19 00:56:18,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:18,925 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:18,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:56:18,928 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:56:18,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-19 00:56:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:20,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:56:20,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:20,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-19 00:56:22,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:22,094 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 128 treesize of output 68 [2024-11-19 00:56:22,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 64 [2024-11-19 00:56:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:56:22,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1053113317] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:23,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:56:23,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 8] total 21 [2024-11-19 00:56:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636441915] [2024-11-19 00:56:23,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:23,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:23,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:56:23,029 INFO L87 Difference]: Start difference. First operand 290 states and 375 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:24,493 INFO L93 Difference]: Finished difference Result 656 states and 855 transitions. [2024-11-19 00:56:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:24,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 116 [2024-11-19 00:56:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:24,499 INFO L225 Difference]: With dead ends: 656 [2024-11-19 00:56:24,499 INFO L226 Difference]: Without dead ends: 369 [2024-11-19 00:56:24,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2024-11-19 00:56:24,505 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 84 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:24,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 661 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 00:56:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-19 00:56:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 365. [2024-11-19 00:56:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 324 states have (on average 1.2561728395061729) internal successors, (407), 326 states have internal predecessors, (407), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:56:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 479 transitions. [2024-11-19 00:56:24,556 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 479 transitions. Word has length 116 [2024-11-19 00:56:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:24,558 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 479 transitions. [2024-11-19 00:56:24,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 479 transitions. [2024-11-19 00:56:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:56:24,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:24,562 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:24,571 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 (16)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:24,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:24,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:24,962 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1580443261, now seen corresponding path program 1 times [2024-11-19 00:56:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505440835] [2024-11-19 00:56:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:24,964 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-19 00:56:24,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:24,965 INFO L229 MonitoredProcess]: Starting monitored process 18 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-19 00:56:24,966 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 (18)] Waiting until timeout for monitored process [2024-11-19 00:56:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:25,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 00:56:25,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:27,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:27,377 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 96 treesize of output 36 [2024-11-19 00:56:27,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:27,389 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 146 treesize of output 56 [2024-11-19 00:56:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-19 00:56:27,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:28,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:28,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 129 [2024-11-19 00:56:32,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505440835] [2024-11-19 00:56:32,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505440835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:32,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543291292] [2024-11-19 00:56:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:32,284 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:32,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:56:32,286 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:56:32,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-19 00:56:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:33,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:56:33,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:34,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-19 00:56:38,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:38,267 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 129 treesize of output 69 [2024-11-19 00:56:38,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 69 [2024-11-19 00:56:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 00:56:42,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [543291292] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:42,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:56:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 9] total 22 [2024-11-19 00:56:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480945124] [2024-11-19 00:56:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:42,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=530, Unknown=2, NotChecked=0, Total=600 [2024-11-19 00:56:42,913 INFO L87 Difference]: Start difference. First operand 365 states and 479 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:43,533 INFO L93 Difference]: Finished difference Result 735 states and 958 transitions. [2024-11-19 00:56:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:43,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 117 [2024-11-19 00:56:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:43,538 INFO L225 Difference]: With dead ends: 735 [2024-11-19 00:56:43,538 INFO L226 Difference]: Without dead ends: 373 [2024-11-19 00:56:43,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=75, Invalid=572, Unknown=3, NotChecked=0, Total=650 [2024-11-19 00:56:43,540 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 79 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:43,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 468 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:56:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-19 00:56:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 298. [2024-11-19 00:56:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 271 states have (on average 1.2361623616236161) internal successors, (335), 271 states have internal predecessors, (335), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:56:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 379 transitions. [2024-11-19 00:56:43,565 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 379 transitions. Word has length 117 [2024-11-19 00:56:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:43,565 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 379 transitions. [2024-11-19 00:56:43,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 379 transitions. [2024-11-19 00:56:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:56:43,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:43,567 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:43,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-19 00:56:43,779 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 (18)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:43,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /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-19 00:56:43,968 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:43,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1459894537, now seen corresponding path program 1 times [2024-11-19 00:56:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526068737] [2024-11-19 00:56:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:43,969 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-19 00:56:43,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:43,972 INFO L229 MonitoredProcess]: Starting monitored process 20 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-19 00:56:43,973 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 (20)] Waiting until timeout for monitored process [2024-11-19 00:56:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:44,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:56:44,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:45,922 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 21 [2024-11-19 00:56:45,928 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 70 treesize of output 34 [2024-11-19 00:56:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-19 00:56:46,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:46,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:46,612 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 91 treesize of output 66 [2024-11-19 00:56:47,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:47,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526068737] [2024-11-19 00:56:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526068737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1084790369] [2024-11-19 00:56:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:47,333 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:47,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:56:47,335 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:56:47,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-19 00:56:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:48,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:56:48,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:48,873 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 61 treesize of output 37 [2024-11-19 00:56:48,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 49 treesize of output 25 [2024-11-19 00:56:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:48,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1084790369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-19 00:56:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034058477] [2024-11-19 00:56:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:49,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-11-19 00:56:49,001 INFO L87 Difference]: Start difference. First operand 298 states and 379 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:49,282 INFO L93 Difference]: Finished difference Result 611 states and 775 transitions. [2024-11-19 00:56:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:49,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 117 [2024-11-19 00:56:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:49,286 INFO L225 Difference]: With dead ends: 611 [2024-11-19 00:56:49,286 INFO L226 Difference]: Without dead ends: 316 [2024-11-19 00:56:49,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:56:49,287 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 20 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:49,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 532 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-19 00:56:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 272. [2024-11-19 00:56:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 245 states have (on average 1.2530612244897958) internal successors, (307), 245 states have internal predecessors, (307), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:56:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 351 transitions. [2024-11-19 00:56:49,310 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 351 transitions. Word has length 117 [2024-11-19 00:56:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:49,311 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 351 transitions. [2024-11-19 00:56:49,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 351 transitions. [2024-11-19 00:56:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:56:49,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:49,313 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:49,326 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 (20)] Ended with exit code 0 [2024-11-19 00:56:49,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:49,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:49,714 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:49,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1838743132, now seen corresponding path program 1 times [2024-11-19 00:56:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388549643] [2024-11-19 00:56:49,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:49,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-19 00:56:49,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:49,716 INFO L229 MonitoredProcess]: Starting monitored process 22 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-19 00:56:49,717 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 (22)] Waiting until timeout for monitored process [2024-11-19 00:56:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:50,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:56:50,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:51,945 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 21 [2024-11-19 00:56:51,952 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 70 treesize of output 34 [2024-11-19 00:56:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-19 00:56:52,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:52,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:52,902 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 91 treesize of output 66 [2024-11-19 00:56:53,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388549643] [2024-11-19 00:56:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388549643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:53,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [552148921] [2024-11-19 00:56:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:53,425 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:53,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:56:53,426 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:56:53,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-19 00:56:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:54,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:56:54,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:54,892 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 62 treesize of output 38 [2024-11-19 00:56:54,898 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 50 treesize of output 26 [2024-11-19 00:56:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:56:55,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [552148921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:55,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:55,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-19 00:56:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890162872] [2024-11-19 00:56:55,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:55,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:56:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:56:55,039 INFO L87 Difference]: Start difference. First operand 272 states and 351 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:55,306 INFO L93 Difference]: Finished difference Result 559 states and 719 transitions. [2024-11-19 00:56:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:55,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 117 [2024-11-19 00:56:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:55,309 INFO L225 Difference]: With dead ends: 559 [2024-11-19 00:56:55,309 INFO L226 Difference]: Without dead ends: 290 [2024-11-19 00:56:55,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:56:55,310 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 36 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:55,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 576 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-19 00:56:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 174. [2024-11-19 00:56:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.23125) internal successors, (197), 160 states have internal predecessors, (197), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:56:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2024-11-19 00:56:55,329 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 117 [2024-11-19 00:56:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:55,329 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2024-11-19 00:56:55,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:56:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2024-11-19 00:56:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:56:55,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:55,331 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:56:55,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-19 00:56:55,543 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 (22)] Ended with exit code 0 [2024-11-19 00:56:55,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /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-19 00:56:55,732 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:55,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:55,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2030346274, now seen corresponding path program 1 times [2024-11-19 00:56:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:56:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188694349] [2024-11-19 00:56:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:55,733 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-19 00:56:55,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:56:55,734 INFO L229 MonitoredProcess]: Starting monitored process 24 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-19 00:56:55,735 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 (24)] Waiting until timeout for monitored process [2024-11-19 00:56:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:56,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 00:56:56,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:57,041 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 18 treesize of output 19 [2024-11-19 00:56:57,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:57,405 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 64 treesize of output 24 [2024-11-19 00:56:57,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:56:57,497 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 197 treesize of output 77 [2024-11-19 00:56:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:56:57,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:58,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:56:58,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188694349] [2024-11-19 00:56:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188694349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1603757544] [2024-11-19 00:56:58,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:58,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:58,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:56:58,165 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:56:58,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-19 00:57:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:00,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-19 00:57:00,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:02,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 00:57:04,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8