./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-3.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 ce7290e6713376455badf7100d5aceeca845cede6d066d71203baae97fa0e235 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:54:16,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:54:16,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:54:16,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:54:16,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:54:16,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:54:16,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:54:16,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:54:16,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:54:16,734 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:54:16,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:54:16,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:54:16,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:54:16,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:54:16,735 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:54:16,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:54:16,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:54:16,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:54:16,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:54:16,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:54:16,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:54:16,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:54:16,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:54:16,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:54:16,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:54:16,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:54:16,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:54:16,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:54:16,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:54:16,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:54:16,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:54:16,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:54:16,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:54:16,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:54:16,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:54:16,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:54:16,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:54:16,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:54:16,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:54:16,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:54:16,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:54:16,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:54:16,743 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 -> ce7290e6713376455badf7100d5aceeca845cede6d066d71203baae97fa0e235 [2024-11-22 12:54:16,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:54:16,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:54:16,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:54:16,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:54:16,979 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:54:16,980 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-3.i [2024-11-22 12:54:18,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:54:18,413 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:54:18,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2024-11-22 12:54:18,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a350e2c/84f1ae322bdb488995203607cd45ae00/FLAG4b61be429 [2024-11-22 12:54:18,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a350e2c/84f1ae322bdb488995203607cd45ae00 [2024-11-22 12:54:18,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:54:18,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:54:18,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:54:18,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:54:18,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:54:18,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31117e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18, skipping insertion in model container [2024-11-22 12:54:18,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:54:18,614 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-3.i[915,928] [2024-11-22 12:54:18,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:54:18,678 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:54:18,687 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-3.i[915,928] [2024-11-22 12:54:18,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:54:18,741 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:54:18,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18 WrapperNode [2024-11-22 12:54:18,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:54:18,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:54:18,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:54:18,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:54:18,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,792 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 665 [2024-11-22 12:54:18,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:54:18,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:54:18,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:54:18,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:54:18,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,826 INFO L175 MemorySlicer]: Split 151 memory accesses to 15 slices as follows [2, 5, 8, 10, 5, 10, 8, 12, 8, 8, 5, 14, 14, 12, 30]. 20 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1]. [2024-11-22 12:54:18,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:54:18,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:54:18,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:54:18,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:54:18,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (1/1) ... [2024-11-22 12:54:18,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:54:18,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:54:18,923 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-22 12:54:18,925 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-22 12:54:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:54:18,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:54:18,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:54:18,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:54:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:54:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:54:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 12:54:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-22 12:54:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-22 12:54:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-22 12:54:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-22 12:54:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-22 12:54:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-22 12:54:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-22 12:54:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-22 12:54:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-22 12:54:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:54:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:54:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:54:18,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-22 12:54:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-22 12:54:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-22 12:54:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-22 12:54:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:54:18,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:54:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:54:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:54:19,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:54:19,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 12:54:19,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-22 12:54:19,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-22 12:54:19,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-22 12:54:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-22 12:54:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-22 12:54:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-22 12:54:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-22 12:54:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-22 12:54:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-22 12:54:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-22 12:54:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-22 12:54:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-22 12:54:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-22 12:54:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-22 12:54:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:54:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:54:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:54:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:54:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:54:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 12:54:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-22 12:54:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-22 12:54:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-22 12:54:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-22 12:54:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-22 12:54:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-22 12:54:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-22 12:54:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-22 12:54:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-22 12:54:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:54:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:54:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-22 12:54:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:54:19,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:54:19,188 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:54:19,190 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:54:19,633 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-22 12:54:19,633 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:54:19,647 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:54:19,647 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:54:19,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:54:19 BoogieIcfgContainer [2024-11-22 12:54:19,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:54:19,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:54:19,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:54:19,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:54:19,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:54:18" (1/3) ... [2024-11-22 12:54:19,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67921e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:54:19, skipping insertion in model container [2024-11-22 12:54:19,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:18" (2/3) ... [2024-11-22 12:54:19,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67921e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:54:19, skipping insertion in model container [2024-11-22 12:54:19,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:54:19" (3/3) ... [2024-11-22 12:54:19,654 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-3.i [2024-11-22 12:54:19,666 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:54:19,666 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:54:19,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:54:19,727 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;@be346e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:54:19,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:54:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 12:54:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:54:19,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:19,745 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:19,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:19,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -962361363, now seen corresponding path program 1 times [2024-11-22 12:54:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690513465] [2024-11-22 12:54:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 12:54:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690513465] [2024-11-22 12:54:20,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690513465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:54:20,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382507889] [2024-11-22 12:54:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:20,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:54:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:54:20,130 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-22 12:54:20,131 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-22 12:54:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:20,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:54:20,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 12:54:20,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:20,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382507889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:20,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:54:20,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:54:20,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128106584] [2024-11-22 12:54:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:20,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:54:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:20,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:54:20,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:54:20,440 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 12:54:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:20,470 INFO L93 Difference]: Finished difference Result 291 states and 454 transitions. [2024-11-22 12:54:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:54:20,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-22 12:54:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:20,481 INFO L225 Difference]: With dead ends: 291 [2024-11-22 12:54:20,481 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 12:54:20,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-22 12:54:20,489 INFO L432 NwaCegarLoop]: 215 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, 215 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-22 12:54:20,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 12:54:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-22 12:54:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 12:54:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-11-22 12:54:20,537 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2024-11-22 12:54:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:20,537 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-11-22 12:54:20,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 12:54:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-11-22 12:54:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:54:20,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:20,540 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:20,553 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-22 12:54:20,740 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-22 12:54:20,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:20,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:20,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1607444309, now seen corresponding path program 1 times [2024-11-22 12:54:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:20,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539380544] [2024-11-22 12:54:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:21,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:21,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539380544] [2024-11-22 12:54:21,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539380544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:21,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:21,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:54:21,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269313510] [2024-11-22 12:54:21,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:21,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:54:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:54:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:54:21,003 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 12:54:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:21,073 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2024-11-22 12:54:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:54:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-22 12:54:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:21,075 INFO L225 Difference]: With dead ends: 289 [2024-11-22 12:54:21,075 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 12:54:21,076 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-22 12:54:21,077 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 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-22 12:54:21,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 12:54:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-22 12:54:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 12:54:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-22 12:54:21,102 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-22 12:54:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:21,114 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-22 12:54:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 12:54:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-22 12:54:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:54:21,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:21,116 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:21,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:54:21,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:21,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1658163689, now seen corresponding path program 1 times [2024-11-22 12:54:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779593577] [2024-11-22 12:54:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:54:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779593577] [2024-11-22 12:54:21,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779593577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:54:21,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963758545] [2024-11-22 12:54:21,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:21,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:54:21,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:54:21,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:54:21,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 12:54:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:21,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:54:21,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:21,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:21,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963758545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:21,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:54:21,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-22 12:54:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210223765] [2024-11-22 12:54:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:21,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:54:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:21,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:54:21,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:54:21,669 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:21,699 INFO L93 Difference]: Finished difference Result 293 states and 434 transitions. [2024-11-22 12:54:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:54:21,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-22 12:54:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:21,701 INFO L225 Difference]: With dead ends: 293 [2024-11-22 12:54:21,701 INFO L226 Difference]: Without dead ends: 149 [2024-11-22 12:54:21,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:54:21,702 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 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-22 12:54:21,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-22 12:54:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-22 12:54:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 12:54:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-11-22 12:54:21,710 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 133 [2024-11-22 12:54:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:21,710 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-11-22 12:54:21,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-11-22 12:54:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:54:21,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:21,712 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:21,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 12:54:21,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 12:54:21,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:21,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 565461865, now seen corresponding path program 1 times [2024-11-22 12:54:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133080378] [2024-11-22 12:54:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:22,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133080378] [2024-11-22 12:54:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133080378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:22,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:54:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518062646] [2024-11-22 12:54:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:22,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:54:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:22,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:54:22,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:54:22,013 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:22,039 INFO L93 Difference]: Finished difference Result 372 states and 550 transitions. [2024-11-22 12:54:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:54:22,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-22 12:54:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:22,041 INFO L225 Difference]: With dead ends: 372 [2024-11-22 12:54:22,042 INFO L226 Difference]: Without dead ends: 226 [2024-11-22 12:54:22,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 12:54:22,043 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:22,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-22 12:54:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2024-11-22 12:54:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.4478527607361964) internal successors, (236), 163 states have internal predecessors, (236), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 12:54:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 268 transitions. [2024-11-22 12:54:22,059 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 268 transitions. Word has length 135 [2024-11-22 12:54:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:22,059 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 268 transitions. [2024-11-22 12:54:22,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 268 transitions. [2024-11-22 12:54:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:54:22,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:22,062 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:22,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 12:54:22,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:22,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash -612419662, now seen corresponding path program 1 times [2024-11-22 12:54:22,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159191404] [2024-11-22 12:54:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:22,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:22,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159191404] [2024-11-22 12:54:22,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159191404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:22,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:54:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777403532] [2024-11-22 12:54:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:22,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:54:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:54:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:54:22,488 INFO L87 Difference]: Start difference. First operand 181 states and 268 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:22,586 INFO L93 Difference]: Finished difference Result 471 states and 696 transitions. [2024-11-22 12:54:22,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:54:22,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-22 12:54:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:22,588 INFO L225 Difference]: With dead ends: 471 [2024-11-22 12:54:22,589 INFO L226 Difference]: Without dead ends: 293 [2024-11-22 12:54:22,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:54:22,591 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 118 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:22,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1088 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-22 12:54:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2024-11-22 12:54:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 267 states have (on average 1.453183520599251) internal successors, (388), 268 states have internal predecessors, (388), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 12:54:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 428 transitions. [2024-11-22 12:54:22,615 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 428 transitions. Word has length 135 [2024-11-22 12:54:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:22,615 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 428 transitions. [2024-11-22 12:54:22,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 428 transitions. [2024-11-22 12:54:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 12:54:22,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:22,617 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:54:22,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -262788130, now seen corresponding path program 1 times [2024-11-22 12:54:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920252960] [2024-11-22 12:54:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:54:22,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:22,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920252960] [2024-11-22 12:54:22,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920252960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:54:22,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99012083] [2024-11-22 12:54:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:54:22,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:54:22,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:54:22,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 12:54:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:22,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:54:23,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:23,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99012083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:54:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-22 12:54:23,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858230244] [2024-11-22 12:54:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:23,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:54:23,042 INFO L87 Difference]: Start difference. First operand 290 states and 428 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:23,071 INFO L93 Difference]: Finished difference Result 583 states and 861 transitions. [2024-11-22 12:54:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:54:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-22 12:54:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:23,074 INFO L225 Difference]: With dead ends: 583 [2024-11-22 12:54:23,074 INFO L226 Difference]: Without dead ends: 296 [2024-11-22 12:54:23,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:54:23,075 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:23,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-22 12:54:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-11-22 12:54:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 269 states have (on average 1.449814126394052) internal successors, (390), 270 states have internal predecessors, (390), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 12:54:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 430 transitions. [2024-11-22 12:54:23,085 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 430 transitions. Word has length 136 [2024-11-22 12:54:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:23,086 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 430 transitions. [2024-11-22 12:54:23,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 430 transitions. [2024-11-22 12:54:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 12:54:23,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:23,091 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:23,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 12:54:23,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:54:23,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash 130892061, now seen corresponding path program 1 times [2024-11-22 12:54:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005975007] [2024-11-22 12:54:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:54:23,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005975007] [2024-11-22 12:54:23,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005975007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:54:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170779189] [2024-11-22 12:54:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:23,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:54:23,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:54:23,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:54:23,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 12:54:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:23,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:54:23,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:23,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170779189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:23,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:54:23,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-22 12:54:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965660773] [2024-11-22 12:54:23,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:23,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:23,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:54:23,668 INFO L87 Difference]: Start difference. First operand 292 states and 430 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:23,691 INFO L93 Difference]: Finished difference Result 587 states and 865 transitions. [2024-11-22 12:54:23,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:54:23,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-22 12:54:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:23,693 INFO L225 Difference]: With dead ends: 587 [2024-11-22 12:54:23,693 INFO L226 Difference]: Without dead ends: 298 [2024-11-22 12:54:23,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:54:23,694 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:23,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-22 12:54:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-22 12:54:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 275 states have (on average 1.44) internal successors, (396), 276 states have internal predecessors, (396), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 12:54:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 436 transitions. [2024-11-22 12:54:23,700 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 436 transitions. Word has length 137 [2024-11-22 12:54:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:23,701 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 436 transitions. [2024-11-22 12:54:23,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 436 transitions. [2024-11-22 12:54:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 12:54:23,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:23,702 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:23,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 12:54:23,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:54:23,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:23,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1320109804, now seen corresponding path program 1 times [2024-11-22 12:54:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:23,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689029939] [2024-11-22 12:54:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:23,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:24,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:24,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689029939] [2024-11-22 12:54:24,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689029939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:24,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:24,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:54:24,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964600802] [2024-11-22 12:54:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:24,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:54:24,157 INFO L87 Difference]: Start difference. First operand 298 states and 436 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:24,279 INFO L93 Difference]: Finished difference Result 662 states and 970 transitions. [2024-11-22 12:54:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:54:24,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-22 12:54:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:24,282 INFO L225 Difference]: With dead ends: 662 [2024-11-22 12:54:24,282 INFO L226 Difference]: Without dead ends: 367 [2024-11-22 12:54:24,283 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-22 12:54:24,284 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 196 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:24,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1104 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-22 12:54:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 359. [2024-11-22 12:54:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 323 states have (on average 1.4210526315789473) internal successors, (459), 323 states have internal predecessors, (459), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 12:54:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 523 transitions. [2024-11-22 12:54:24,294 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 523 transitions. Word has length 137 [2024-11-22 12:54:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:24,295 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 523 transitions. [2024-11-22 12:54:24,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 523 transitions. [2024-11-22 12:54:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 12:54:24,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:24,296 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:24,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 12:54:24,296 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:24,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1604988632, now seen corresponding path program 1 times [2024-11-22 12:54:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:24,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012707425] [2024-11-22 12:54:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:24,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012707425] [2024-11-22 12:54:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012707425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:24,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:54:24,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297238832] [2024-11-22 12:54:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:24,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:54:24,489 INFO L87 Difference]: Start difference. First operand 359 states and 523 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:24,594 INFO L93 Difference]: Finished difference Result 727 states and 1060 transitions. [2024-11-22 12:54:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:54:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-22 12:54:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:24,596 INFO L225 Difference]: With dead ends: 727 [2024-11-22 12:54:24,596 INFO L226 Difference]: Without dead ends: 371 [2024-11-22 12:54:24,597 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-22 12:54:24,597 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 202 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:24,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1042 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-22 12:54:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2024-11-22 12:54:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 327 states have (on average 1.4128440366972477) internal successors, (462), 327 states have internal predecessors, (462), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 12:54:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 526 transitions. [2024-11-22 12:54:24,608 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 526 transitions. Word has length 137 [2024-11-22 12:54:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:24,608 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 526 transitions. [2024-11-22 12:54:24,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 526 transitions. [2024-11-22 12:54:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:24,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:24,610 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:24,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 12:54:24,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:24,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:24,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1945701522, now seen corresponding path program 1 times [2024-11-22 12:54:24,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:24,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64307570] [2024-11-22 12:54:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:24,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:25,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:25,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64307570] [2024-11-22 12:54:25,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64307570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:25,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:25,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 12:54:25,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022453180] [2024-11-22 12:54:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:25,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 12:54:25,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:25,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 12:54:25,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:54:25,151 INFO L87 Difference]: Start difference. First operand 363 states and 526 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:25,364 INFO L93 Difference]: Finished difference Result 842 states and 1218 transitions. [2024-11-22 12:54:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 12:54:25,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:54:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:25,366 INFO L225 Difference]: With dead ends: 842 [2024-11-22 12:54:25,366 INFO L226 Difference]: Without dead ends: 482 [2024-11-22 12:54:25,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:54:25,367 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 120 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:25,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2579 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-22 12:54:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 479. [2024-11-22 12:54:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 438 states have (on average 1.4155251141552512) internal successors, (620), 439 states have internal predecessors, (620), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 12:54:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 692 transitions. [2024-11-22 12:54:25,380 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 692 transitions. Word has length 139 [2024-11-22 12:54:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:25,380 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 692 transitions. [2024-11-22 12:54:25,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 692 transitions. [2024-11-22 12:54:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:25,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:25,381 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:25,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 12:54:25,382 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:25,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1648201196, now seen corresponding path program 1 times [2024-11-22 12:54:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:25,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118862375] [2024-11-22 12:54:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118862375] [2024-11-22 12:54:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118862375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:25,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:54:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553021412] [2024-11-22 12:54:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:25,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:54:25,516 INFO L87 Difference]: Start difference. First operand 479 states and 692 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:25,584 INFO L93 Difference]: Finished difference Result 977 states and 1409 transitions. [2024-11-22 12:54:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:54:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:54:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:25,586 INFO L225 Difference]: With dead ends: 977 [2024-11-22 12:54:25,586 INFO L226 Difference]: Without dead ends: 501 [2024-11-22 12:54:25,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:54:25,587 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 127 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:25,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1096 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-22 12:54:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 498. [2024-11-22 12:54:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 448 states have (on average 1.4040178571428572) internal successors, (629), 450 states have internal predecessors, (629), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-22 12:54:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 717 transitions. [2024-11-22 12:54:25,604 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 717 transitions. Word has length 139 [2024-11-22 12:54:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:25,605 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 717 transitions. [2024-11-22 12:54:25,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 717 transitions. [2024-11-22 12:54:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:25,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:25,607 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:25,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 12:54:25,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:25,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1128053072, now seen corresponding path program 1 times [2024-11-22 12:54:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:25,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316066623] [2024-11-22 12:54:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:25,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316066623] [2024-11-22 12:54:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316066623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:25,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:25,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:54:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587891790] [2024-11-22 12:54:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:25,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:25,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:54:25,732 INFO L87 Difference]: Start difference. First operand 498 states and 717 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:25,803 INFO L93 Difference]: Finished difference Result 991 states and 1423 transitions. [2024-11-22 12:54:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:54:25,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:54:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:25,806 INFO L225 Difference]: With dead ends: 991 [2024-11-22 12:54:25,806 INFO L226 Difference]: Without dead ends: 505 [2024-11-22 12:54:25,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:54:25,807 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 125 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:25,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1168 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-22 12:54:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 481. [2024-11-22 12:54:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 439 states have (on average 1.4100227790432802) internal successors, (619), 440 states have internal predecessors, (619), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 12:54:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 691 transitions. [2024-11-22 12:54:25,825 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 691 transitions. Word has length 139 [2024-11-22 12:54:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:25,826 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 691 transitions. [2024-11-22 12:54:25,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 691 transitions. [2024-11-22 12:54:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:25,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:25,827 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:25,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 12:54:25,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:25,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1829117650, now seen corresponding path program 1 times [2024-11-22 12:54:25,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:25,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176899672] [2024-11-22 12:54:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:25,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:26,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176899672] [2024-11-22 12:54:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176899672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:26,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:26,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 12:54:26,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975289384] [2024-11-22 12:54:26,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:26,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 12:54:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 12:54:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:54:26,272 INFO L87 Difference]: Start difference. First operand 481 states and 691 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:26,467 INFO L93 Difference]: Finished difference Result 977 states and 1400 transitions. [2024-11-22 12:54:26,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 12:54:26,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:54:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:26,469 INFO L225 Difference]: With dead ends: 977 [2024-11-22 12:54:26,469 INFO L226 Difference]: Without dead ends: 499 [2024-11-22 12:54:26,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:54:26,470 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 116 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:26,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 2649 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-22 12:54:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 441. [2024-11-22 12:54:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 399 states have (on average 1.406015037593985) internal successors, (561), 400 states have internal predecessors, (561), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 12:54:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 633 transitions. [2024-11-22 12:54:26,484 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 633 transitions. Word has length 139 [2024-11-22 12:54:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:26,485 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 633 transitions. [2024-11-22 12:54:26,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 633 transitions. [2024-11-22 12:54:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:26,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:26,486 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:26,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 12:54:26,487 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 196071605, now seen corresponding path program 1 times [2024-11-22 12:54:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910586353] [2024-11-22 12:54:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:26,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910586353] [2024-11-22 12:54:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910586353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:26,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:54:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262806405] [2024-11-22 12:54:26,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:26,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:54:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:26,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:54:26,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:54:26,558 INFO L87 Difference]: Start difference. First operand 441 states and 633 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:26,582 INFO L93 Difference]: Finished difference Result 941 states and 1344 transitions. [2024-11-22 12:54:26,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:54:26,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:54:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:26,584 INFO L225 Difference]: With dead ends: 941 [2024-11-22 12:54:26,585 INFO L226 Difference]: Without dead ends: 512 [2024-11-22 12:54:26,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 12:54:26,586 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 103 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:26,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 507 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-22 12:54:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 418. [2024-11-22 12:54:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 376 states have (on average 1.3829787234042554) internal successors, (520), 377 states have internal predecessors, (520), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 12:54:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 592 transitions. [2024-11-22 12:54:26,602 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 592 transitions. Word has length 139 [2024-11-22 12:54:26,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:26,602 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 592 transitions. [2024-11-22 12:54:26,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 592 transitions. [2024-11-22 12:54:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 12:54:26,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:26,604 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:26,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 12:54:26,605 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:26,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1925589886, now seen corresponding path program 1 times [2024-11-22 12:54:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:26,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397778900] [2024-11-22 12:54:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:27,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397778900] [2024-11-22 12:54:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397778900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 12:54:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462744098] [2024-11-22 12:54:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:27,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:54:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:54:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:54:27,232 INFO L87 Difference]: Start difference. First operand 418 states and 592 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:27,502 INFO L93 Difference]: Finished difference Result 1104 states and 1559 transitions. [2024-11-22 12:54:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 12:54:27,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-22 12:54:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:27,505 INFO L225 Difference]: With dead ends: 1104 [2024-11-22 12:54:27,505 INFO L226 Difference]: Without dead ends: 698 [2024-11-22 12:54:27,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-22 12:54:27,508 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 217 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:27,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1692 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-22 12:54:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 686. [2024-11-22 12:54:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 637 states have (on average 1.3987441130298273) internal successors, (891), 640 states have internal predecessors, (891), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:54:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 971 transitions. [2024-11-22 12:54:27,530 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 971 transitions. Word has length 140 [2024-11-22 12:54:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:27,530 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 971 transitions. [2024-11-22 12:54:27,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 971 transitions. [2024-11-22 12:54:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 12:54:27,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:27,532 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:27,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 12:54:27,532 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:27,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1534724056, now seen corresponding path program 1 times [2024-11-22 12:54:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:27,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354526551] [2024-11-22 12:54:27,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:27,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354526551] [2024-11-22 12:54:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354526551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:54:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656524310] [2024-11-22 12:54:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:54:27,682 INFO L87 Difference]: Start difference. First operand 686 states and 971 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:27,762 INFO L93 Difference]: Finished difference Result 1620 states and 2300 transitions. [2024-11-22 12:54:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:54:27,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-22 12:54:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:27,766 INFO L225 Difference]: With dead ends: 1620 [2024-11-22 12:54:27,766 INFO L226 Difference]: Without dead ends: 950 [2024-11-22 12:54:27,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:54:27,768 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 113 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:27,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 831 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-22 12:54:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 856. [2024-11-22 12:54:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 807 states have (on average 1.4039653035935564) internal successors, (1133), 810 states have internal predecessors, (1133), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-22 12:54:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1213 transitions. [2024-11-22 12:54:27,791 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1213 transitions. Word has length 140 [2024-11-22 12:54:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:27,791 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1213 transitions. [2024-11-22 12:54:27,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1213 transitions. [2024-11-22 12:54:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-22 12:54:27,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:27,793 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:27,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 12:54:27,793 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:27,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:27,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1464841491, now seen corresponding path program 1 times [2024-11-22 12:54:27,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:27,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554811562] [2024-11-22 12:54:27,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:54:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554811562] [2024-11-22 12:54:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554811562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:54:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576031161] [2024-11-22 12:54:28,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:28,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:54:28,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:54:28,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:54:28,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 12:54:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:28,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 12:54:28,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:28,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 12:54:29,420 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-22 12:54:29,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 61 [2024-11-22 12:54:29,424 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 48 treesize of output 36 [2024-11-22 12:54:29,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-11-22 12:54:29,460 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 12:54:29,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-11-22 12:54:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 12:54:29,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:54:30,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-11-22 12:54:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:54:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576031161] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:54:30,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 12:54:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 29 [2024-11-22 12:54:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183408428] [2024-11-22 12:54:30,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 12:54:30,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-22 12:54:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-22 12:54:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2024-11-22 12:54:30,105 INFO L87 Difference]: Start difference. First operand 856 states and 1213 transitions. Second operand has 29 states, 26 states have (on average 6.615384615384615) internal successors, (172), 28 states have internal predecessors, (172), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) [2024-11-22 12:54:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:31,508 INFO L93 Difference]: Finished difference Result 2162 states and 3038 transitions. [2024-11-22 12:54:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-22 12:54:31,509 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.615384615384615) internal successors, (172), 28 states have internal predecessors, (172), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) Word has length 142 [2024-11-22 12:54:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:31,516 INFO L225 Difference]: With dead ends: 2162 [2024-11-22 12:54:31,517 INFO L226 Difference]: Without dead ends: 1322 [2024-11-22 12:54:31,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=793, Invalid=2989, Unknown=0, NotChecked=0, Total=3782 [2024-11-22 12:54:31,520 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1843 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:31,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 2640 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 12:54:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2024-11-22 12:54:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 950. [2024-11-22 12:54:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 890 states have (on average 1.3943820224719101) internal successors, (1241), 890 states have internal predecessors, (1241), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:54:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1337 transitions. [2024-11-22 12:54:31,551 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1337 transitions. Word has length 142 [2024-11-22 12:54:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:31,551 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1337 transitions. [2024-11-22 12:54:31,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.615384615384615) internal successors, (172), 28 states have internal predecessors, (172), 11 states have call successors, (48), 4 states have call predecessors, (48), 6 states have return successors, (48), 8 states have call predecessors, (48), 11 states have call successors, (48) [2024-11-22 12:54:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1337 transitions. [2024-11-22 12:54:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-22 12:54:31,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:31,553 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:31,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 12:54:31,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-22 12:54:31,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:31,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:31,754 INFO L85 PathProgramCache]: Analyzing trace with hash -197797436, now seen corresponding path program 1 times [2024-11-22 12:54:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847180756] [2024-11-22 12:54:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:31,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:31,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847180756] [2024-11-22 12:54:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847180756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:31,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:31,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:54:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571028541] [2024-11-22 12:54:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:31,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:54:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:31,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:54:31,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:54:31,901 INFO L87 Difference]: Start difference. First operand 950 states and 1337 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:32,022 INFO L93 Difference]: Finished difference Result 1811 states and 2537 transitions. [2024-11-22 12:54:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:54:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142 [2024-11-22 12:54:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:32,026 INFO L225 Difference]: With dead ends: 1811 [2024-11-22 12:54:32,026 INFO L226 Difference]: Without dead ends: 1106 [2024-11-22 12:54:32,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:54:32,028 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 162 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:32,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1256 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-11-22 12:54:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1012. [2024-11-22 12:54:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 941 states have (on average 1.3889479277364505) internal successors, (1307), 942 states have internal predecessors, (1307), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 12:54:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1419 transitions. [2024-11-22 12:54:32,057 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1419 transitions. Word has length 142 [2024-11-22 12:54:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:32,057 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1419 transitions. [2024-11-22 12:54:32,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1419 transitions. [2024-11-22 12:54:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 12:54:32,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:32,059 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:32,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 12:54:32,059 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:32,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1380781314, now seen corresponding path program 1 times [2024-11-22 12:54:32,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:32,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222164419] [2024-11-22 12:54:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:32,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:54:32,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222164419] [2024-11-22 12:54:32,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222164419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:32,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:32,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:54:32,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123206029] [2024-11-22 12:54:32,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:32,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:54:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:54:32,176 INFO L87 Difference]: Start difference. First operand 1012 states and 1419 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:32,264 INFO L93 Difference]: Finished difference Result 2106 states and 2944 transitions. [2024-11-22 12:54:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:54:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-22 12:54:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:32,268 INFO L225 Difference]: With dead ends: 2106 [2024-11-22 12:54:32,268 INFO L226 Difference]: Without dead ends: 1097 [2024-11-22 12:54:32,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:54:32,269 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 100 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:32,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 769 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-22 12:54:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1003. [2024-11-22 12:54:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 932 states have (on average 1.3841201716738198) internal successors, (1290), 933 states have internal predecessors, (1290), 56 states have call successors, (56), 14 states have call predecessors, (56), 14 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-22 12:54:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1402 transitions. [2024-11-22 12:54:32,299 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1402 transitions. Word has length 143 [2024-11-22 12:54:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:32,299 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1402 transitions. [2024-11-22 12:54:32,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1402 transitions. [2024-11-22 12:54:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 12:54:32,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:32,300 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:32,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 12:54:32,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:32,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2079532628, now seen corresponding path program 1 times [2024-11-22 12:54:32,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:54:32,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033274215] [2024-11-22 12:54:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:32,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:54:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:54:32,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:54:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:54:32,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:54:32,468 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:54:32,469 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:54:32,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 12:54:32,472 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:54:32,601 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:54:32,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:54:32 BoogieIcfgContainer [2024-11-22 12:54:32,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:54:32,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:54:32,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:54:32,605 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:54:32,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:54:19" (3/4) ... [2024-11-22 12:54:32,607 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:54:32,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:54:32,608 INFO L158 Benchmark]: Toolchain (without parser) took 14173.40ms. Allocated memory was 180.4MB in the beginning and 478.2MB in the end (delta: 297.8MB). Free memory was 125.9MB in the beginning and 353.1MB in the end (delta: -227.1MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-22 12:54:32,609 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 59.6MB in the beginning and 59.6MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:54:32,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.38ms. Allocated memory is still 180.4MB. Free memory was 125.9MB in the beginning and 109.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 12:54:32,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.30ms. Allocated memory is still 180.4MB. Free memory was 109.3MB in the beginning and 105.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:54:32,609 INFO L158 Benchmark]: Boogie Preprocessor took 82.85ms. Allocated memory is still 180.4MB. Free memory was 105.2MB in the beginning and 146.2MB in the end (delta: -41.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-22 12:54:32,609 INFO L158 Benchmark]: RCFGBuilder took 771.01ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 99.4MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-22 12:54:32,609 INFO L158 Benchmark]: TraceAbstraction took 12954.65ms. Allocated memory was 180.4MB in the beginning and 478.2MB in the end (delta: 297.8MB). Free memory was 98.2MB in the beginning and 353.1MB in the end (delta: -254.9MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-11-22 12:54:32,609 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 478.2MB. Free memory is still 353.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:54:32,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 59.6MB in the beginning and 59.6MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.38ms. Allocated memory is still 180.4MB. Free memory was 125.9MB in the beginning and 109.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.30ms. Allocated memory is still 180.4MB. Free memory was 109.3MB in the beginning and 105.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.85ms. Allocated memory is still 180.4MB. Free memory was 105.2MB in the beginning and 146.2MB in the end (delta: -41.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * RCFGBuilder took 771.01ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 99.4MB in the end (delta: 46.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12954.65ms. Allocated memory was 180.4MB in the beginning and 478.2MB in the end (delta: 297.8MB). Free memory was 98.2MB in the beginning and 353.1MB in the end (delta: -254.9MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 478.2MB. Free memory is still 353.1MB. 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 someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someUnaryDOUBLEoperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] signed long int var_1_6 = -64; [L28] signed long int var_1_6 = -64; [L29] signed long int* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = -5; [L30] signed long int var_1_7 = -5; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = 500; [L32] signed long int var_1_8 = 500; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] signed long int var_1_9 = -5; [L34] signed long int var_1_9 = -5; [L35] signed long int* var_1_9_Pointer = &(var_1_9); [L36] signed long int var_1_10 = -100; [L36] signed long int var_1_10 = -100; [L37] signed long int* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_11 = 1; [L38] unsigned char var_1_11 = 1; [L39] unsigned char* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 127.5; [L40] double var_1_12 = 127.5; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] double var_1_13 = 15.75; [L42] double var_1_13 = 15.75; [L43] double* var_1_13_Pointer = &(var_1_13); [L44] double var_1_14 = -0.5; [L44] double var_1_14 = -0.5; [L45] double* var_1_14_Pointer = &(var_1_14); [L46] double var_1_15 = 5.25; [L46] double var_1_15 = 5.25; [L47] double* var_1_15_Pointer = &(var_1_15); [L48] double var_1_16 = 8.5; [L48] double var_1_16 = 8.5; [L49] double* var_1_16_Pointer = &(var_1_16); [L50] unsigned char last_1_var_1_11 = 1; VAL [isInitial=0, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR \read(var_1_11) [L109] last_1_var_1_11 = var_1_11 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] var_1_7 = __VERIFIER_nondet_long() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_8 = __VERIFIER_nondet_long() [L91] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_9 = __VERIFIER_nondet_long() [L94] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] var_1_10 = __VERIFIER_nondet_long() [L97] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] EXPR \read(var_1_13) [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F [L100] EXPR \read(var_1_13) [L100] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] var_1_14 = __VERIFIER_nondet_double() [L102] EXPR \read(var_1_14) [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L102] EXPR \read(var_1_14) [L102] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] var_1_15 = __VERIFIER_nondet_double() [L104] EXPR \read(var_1_15) [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F [L104] EXPR \read(var_1_15) [L104] EXPR var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] var_1_16 = __VERIFIER_nondet_double() [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F [L106] EXPR \read(var_1_16) [L106] EXPR var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] RET updateVariables() [L121] CALL step() [L54] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L60] EXPR \read(*var_1_7_Pointer) [L60] signed long int stepLocal_2 = (*(var_1_7_Pointer)); [L61] EXPR \read(*var_1_10_Pointer) [L61] signed long int stepLocal_1 = (*(var_1_10_Pointer)); [L62] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !((*(var_1_8_Pointer)) <= stepLocal_2) [L69] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L69] COND FALSE !(! (*(var_1_11_Pointer))) [L72] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) [L72] EXPR \read(*var_1_9_Pointer) [L72] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR \read(*var_1_10_Pointer) [L72] EXPR \read(*var_1_7_Pointer) [L72] (*(var_1_6_Pointer)) = (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))) [L74] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND FALSE !((*(var_1_4_Pointer))) [L77] EXPR \read(*var_1_15_Pointer) [L77] (*(var_1_12_Pointer)) = (*(var_1_15_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1 [L112] EXPR (! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) [L112] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))) [L112] EXPR \read(*var_1_6_Pointer) [L112] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) [L112] EXPR \read(*var_1_9_Pointer) [L112] EXPR (((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR \read(*var_1_10_Pointer) [L112] EXPR \read(*var_1_7_Pointer) [L112] EXPR (! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) [L112] EXPR \read(*var_1_8_Pointer) [L112] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1 [L112] EXPR ((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) [L112] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer)))) [L112] EXPR \read(*var_1_12_Pointer) [L112] EXPR \read(*var_1_15_Pointer) [L112] EXPR (*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer)))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] EXPR ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112-L113] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : 1) : 1) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (((((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) + (*(var_1_10_Pointer))) + (*(var_1_7_Pointer))))))) && (((*(var_1_8_Pointer)) <= (*(var_1_7_Pointer))) ? (((*(var_1_10_Pointer)) >= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (! (*(var_1_5_Pointer))))) : ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_1_Pointer)) || (! (*(var_1_5_Pointer))))))) : 1)) && ((*(var_1_4_Pointer)) ? ((*(var_1_12_Pointer)) == ((double) ((((((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) < ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))))))) ? (((((((*(var_1_13_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_13_Pointer))) : ((*(var_1_14_Pointer))))) + (*(var_1_15_Pointer)))) : ((((((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer))))) : ((((3.5) < ((*(var_1_16_Pointer)))) ? (3.5) : ((*(var_1_16_Pointer)))))))))))) : ((*(var_1_12_Pointer)) == ((double) (*(var_1_15_Pointer))))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3657 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3656 mSDsluCounter, 21969 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17152 mSDsCounter, 301 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2077 IncrementalHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 301 mSolverCounterUnsat, 4817 mSDtfsCounter, 2077 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1003 GetRequests, 840 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred in iteration=18, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 916 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 3442 NumberOfCodeBlocks, 3442 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3416 ConstructedInterpolants, 122 QuantifiedInterpolants, 9031 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2910 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 11571/12000 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-22 12:54:32,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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-3.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 ce7290e6713376455badf7100d5aceeca845cede6d066d71203baae97fa0e235 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:54:34,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:54:34,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:54:34,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:54:34,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:54:34,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:54:34,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:54:34,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:54:34,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:54:34,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:54:34,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:54:34,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:54:34,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:54:34,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:54:34,611 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:54:34,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:54:34,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:54:34,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:54:34,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:54:34,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:54:34,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:54:34,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:54:34,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:54:34,616 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:54:34,616 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:54:34,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:54:34,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:54:34,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:54:34,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:54:34,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:54:34,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:54:34,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:54:34,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:54:34,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:54:34,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:54:34,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:54:34,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:54:34,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:54:34,618 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:54:34,619 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:54:34,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:54:34,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:54:34,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:54:34,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:54:34,620 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 -> ce7290e6713376455badf7100d5aceeca845cede6d066d71203baae97fa0e235 [2024-11-22 12:54:34,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:54:34,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:54:34,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:54:34,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:54:34,894 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:54:34,895 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-3.i [2024-11-22 12:54:36,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:54:36,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:54:36,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-3.i [2024-11-22 12:54:36,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262f23cfb/ad4edb1c5a5a4d75a08b3e74e07c5224/FLAGcc9cd7023 [2024-11-22 12:54:36,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262f23cfb/ad4edb1c5a5a4d75a08b3e74e07c5224 [2024-11-22 12:54:36,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:54:36,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:54:36,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:54:36,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:54:36,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:54:36,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:54:36" (1/1) ... [2024-11-22 12:54:36,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ae1130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:36, skipping insertion in model container [2024-11-22 12:54:36,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:54:36" (1/1) ... [2024-11-22 12:54:36,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:54:36,887 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-3.i[915,928] [2024-11-22 12:54:36,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:54:36,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:54:36,982 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-3.i[915,928] [2024-11-22 12:54:37,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:54:37,060 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:54:37,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37 WrapperNode [2024-11-22 12:54:37,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:54:37,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:54:37,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:54:37,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:54:37,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,140 INFO L138 Inliner]: procedures = 33, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 661 [2024-11-22 12:54:37,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:54:37,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:54:37,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:54:37,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:54:37,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,206 INFO L175 MemorySlicer]: Split 151 memory accesses to 15 slices as follows [2, 5, 8, 10, 5, 10, 8, 12, 8, 8, 5, 14, 14, 12, 30]. 20 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1]. [2024-11-22 12:54:37,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:54:37,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:54:37,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:54:37,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:54:37,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (1/1) ... [2024-11-22 12:54:37,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:54:37,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:54:37,315 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-22 12:54:37,317 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-22 12:54:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:54:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:54:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:54:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:54:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:54:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:54:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-22 12:54:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-22 12:54:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-22 12:54:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-22 12:54:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-22 12:54:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:54:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-22 12:54:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-22 12:54:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-22 12:54:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-22 12:54:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-22 12:54:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-22 12:54:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-22 12:54:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-22 12:54:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-22 12:54:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-22 12:54:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-22 12:54:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-22 12:54:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-22 12:54:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-22 12:54:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-22 12:54:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-22 12:54:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-22 12:54:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-22 12:54:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-22 12:54:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-22 12:54:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-22 12:54:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:54:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:54:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:54:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:54:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:54:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-22 12:54:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-22 12:54:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-22 12:54:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-22 12:54:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-22 12:54:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-22 12:54:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-22 12:54:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-22 12:54:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-22 12:54:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-22 12:54:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 12:54:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 12:54:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 12:54:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 12:54:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-22 12:54:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-22 12:54:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-22 12:54:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:54:37,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:54:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:54:37,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:54:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:54:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:54:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:54:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:54:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:54:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-22 12:54:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-22 12:54:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-22 12:54:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-22 12:54:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-22 12:54:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-22 12:54:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-22 12:54:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-22 12:54:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-22 12:54:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-22 12:54:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-22 12:54:37,581 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:54:37,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:54:39,183 INFO L? ?]: Removed 192 outVars from TransFormulas that were not future-live. [2024-11-22 12:54:39,183 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:54:39,194 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:54:39,194 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:54:39,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:54:39 BoogieIcfgContainer [2024-11-22 12:54:39,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:54:39,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:54:39,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:54:39,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:54:39,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:54:36" (1/3) ... [2024-11-22 12:54:39,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6457b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:54:39, skipping insertion in model container [2024-11-22 12:54:39,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:37" (2/3) ... [2024-11-22 12:54:39,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6457b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:54:39, skipping insertion in model container [2024-11-22 12:54:39,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:54:39" (3/3) ... [2024-11-22 12:54:39,200 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-3.i [2024-11-22 12:54:39,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:54:39,214 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:54:39,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:54:39,264 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;@7b9fe916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:54:39,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:54:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 12:54:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:54:39,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:39,279 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:39,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -962361363, now seen corresponding path program 1 times [2024-11-22 12:54:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:39,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679139410] [2024-11-22 12:54:39,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:39,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:54:39,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:39,298 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-22 12:54:39,316 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-22 12:54:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:39,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:54:39,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-22 12:54:39,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:39,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:39,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679139410] [2024-11-22 12:54:39,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679139410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:39,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:39,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:54:39,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053903160] [2024-11-22 12:54:39,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:39,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:54:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:39,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:54:39,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:54:39,741 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 12:54:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:39,777 INFO L93 Difference]: Finished difference Result 291 states and 454 transitions. [2024-11-22 12:54:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:54:39,784 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-22 12:54:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:39,790 INFO L225 Difference]: With dead ends: 291 [2024-11-22 12:54:39,791 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 12:54:39,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-22 12:54:39,798 INFO L432 NwaCegarLoop]: 215 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, 215 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-22 12:54:39,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 12:54:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-22 12:54:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 12:54:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2024-11-22 12:54:39,867 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2024-11-22 12:54:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:39,868 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2024-11-22 12:54:39,868 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 12:54:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2024-11-22 12:54:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:54:39,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:39,874 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:39,886 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 (2)] Forceful destruction successful, exit code 0 [2024-11-22 12:54:40,079 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-22 12:54:40,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1607444309, now seen corresponding path program 1 times [2024-11-22 12:54:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:40,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917953141] [2024-11-22 12:54:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:40,082 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-22 12:54:40,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:40,085 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-22 12:54:40,085 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-22 12:54:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:40,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:54:40,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-22 12:54:40,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:40,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:40,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917953141] [2024-11-22 12:54:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917953141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:40,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:40,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:54:40,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378134935] [2024-11-22 12:54:40,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:40,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:54:40,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:54:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:54:40,437 INFO L87 Difference]: Start difference. First operand 145 states and 215 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 12:54:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:40,528 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2024-11-22 12:54:40,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:54:40,530 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-22 12:54:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:40,531 INFO L225 Difference]: With dead ends: 289 [2024-11-22 12:54:40,531 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 12:54:40,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 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-22 12:54:40,533 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 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-22 12:54:40,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 12:54:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-22 12:54:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 12:54:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-22 12:54:40,556 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2024-11-22 12:54:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:40,557 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-22 12:54:40,557 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 12:54:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-22 12:54:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 12:54:40,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:40,559 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:40,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 12:54:40,759 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-22 12:54:40,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1658163689, now seen corresponding path program 1 times [2024-11-22 12:54:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626614771] [2024-11-22 12:54:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:40,761 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-22 12:54:40,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:40,764 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-22 12:54:40,764 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-22 12:54:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:41,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:54:41,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:41,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:54:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:41,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:41,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:41,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626614771] [2024-11-22 12:54:41,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626614771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:41,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:41,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:54:41,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140959573] [2024-11-22 12:54:41,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:41,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:54:41,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:41,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:54:41,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:54:41,423 INFO L87 Difference]: Start difference. First operand 147 states and 217 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:41,496 INFO L93 Difference]: Finished difference Result 435 states and 645 transitions. [2024-11-22 12:54:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:54:41,497 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-22 12:54:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:41,499 INFO L225 Difference]: With dead ends: 435 [2024-11-22 12:54:41,499 INFO L226 Difference]: Without dead ends: 291 [2024-11-22 12:54:41,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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-22 12:54:41,501 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 140 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:41,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 825 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-22 12:54:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 286. [2024-11-22 12:54:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 251 states have (on average 1.4342629482071714) internal successors, (360), 251 states have internal predecessors, (360), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 12:54:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 424 transitions. [2024-11-22 12:54:41,520 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 424 transitions. Word has length 133 [2024-11-22 12:54:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:41,521 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 424 transitions. [2024-11-22 12:54:41,521 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 424 transitions. [2024-11-22 12:54:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 12:54:41,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:41,535 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:41,554 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-22 12:54:41,735 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-22 12:54:41,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:41,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2033493619, now seen corresponding path program 1 times [2024-11-22 12:54:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235250853] [2024-11-22 12:54:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:41,737 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-22 12:54:41,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:41,739 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-22 12:54:41,740 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-22 12:54:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:42,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:54:42,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:42,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2024-11-22 12:54:42,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 12:54:42,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2024-11-22 12:54:42,397 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 40 treesize of output 28 [2024-11-22 12:54:42,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:54:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 12:54:42,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:54:42,513 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 40 treesize of output 36 [2024-11-22 12:54:42,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 12:54:42,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:54:42,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2024-11-22 12:54:42,817 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-22 12:54:42,817 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 20 treesize of output 19 [2024-11-22 12:54:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:54:42,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:42,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235250853] [2024-11-22 12:54:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235250853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:54:42,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:54:42,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-22 12:54:42,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471274675] [2024-11-22 12:54:42,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:54:42,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 12:54:42,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 12:54:42,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:54:42,876 INFO L87 Difference]: Start difference. First operand 286 states and 424 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:54:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:43,698 INFO L93 Difference]: Finished difference Result 598 states and 873 transitions. [2024-11-22 12:54:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 12:54:43,699 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) Word has length 134 [2024-11-22 12:54:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:43,701 INFO L225 Difference]: With dead ends: 598 [2024-11-22 12:54:43,701 INFO L226 Difference]: Without dead ends: 454 [2024-11-22 12:54:43,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 12:54:43,705 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1602 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:43,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 1221 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:54:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-22 12:54:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 294. [2024-11-22 12:54:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 257 states have (on average 1.424124513618677) internal successors, (366), 257 states have internal predecessors, (366), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 12:54:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 430 transitions. [2024-11-22 12:54:43,729 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 430 transitions. Word has length 134 [2024-11-22 12:54:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:43,730 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 430 transitions. [2024-11-22 12:54:43,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:54:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 430 transitions. [2024-11-22 12:54:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 12:54:43,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:43,731 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:43,744 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 (5)] Forceful destruction successful, exit code 0 [2024-11-22 12:54:43,938 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-22 12:54:43,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:43,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1579878723, now seen corresponding path program 1 times [2024-11-22 12:54:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575660966] [2024-11-22 12:54:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:43,940 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-22 12:54:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:43,941 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-22 12:54:43,941 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-22 12:54:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:44,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:54:44,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:44,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:44,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:44,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575660966] [2024-11-22 12:54:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575660966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:44,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:44,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:54:44,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482739700] [2024-11-22 12:54:44,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:44,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:54:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:44,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:54:44,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:54:44,204 INFO L87 Difference]: Start difference. First operand 294 states and 430 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:44,227 INFO L93 Difference]: Finished difference Result 589 states and 863 transitions. [2024-11-22 12:54:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:54:44,227 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-22 12:54:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:44,229 INFO L225 Difference]: With dead ends: 589 [2024-11-22 12:54:44,229 INFO L226 Difference]: Without dead ends: 298 [2024-11-22 12:54:44,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 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-22 12:54:44,230 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 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-22 12:54:44,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-22 12:54:44,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-22 12:54:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 261 states have (on average 1.417624521072797) internal successors, (370), 261 states have internal predecessors, (370), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 12:54:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 434 transitions. [2024-11-22 12:54:44,255 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 434 transitions. Word has length 135 [2024-11-22 12:54:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:44,256 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 434 transitions. [2024-11-22 12:54:44,257 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 434 transitions. [2024-11-22 12:54:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 12:54:44,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:44,261 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:44,270 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-22 12:54:44,461 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-22 12:54:44,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:44,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1512097137, now seen corresponding path program 1 times [2024-11-22 12:54:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697683014] [2024-11-22 12:54:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:44,463 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-22 12:54:44,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:44,464 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-22 12:54:44,465 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-22 12:54:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:44,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:54:44,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:44,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:54:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:44,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:44,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:44,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697683014] [2024-11-22 12:54:44,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697683014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:44,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:44,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:54:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092220972] [2024-11-22 12:54:44,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:44,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:54:44,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:44,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:54:44,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:54:44,871 INFO L87 Difference]: Start difference. First operand 298 states and 434 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:44,988 INFO L93 Difference]: Finished difference Result 874 states and 1277 transitions. [2024-11-22 12:54:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:54:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-22 12:54:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:44,992 INFO L225 Difference]: With dead ends: 874 [2024-11-22 12:54:44,992 INFO L226 Difference]: Without dead ends: 579 [2024-11-22 12:54:44,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 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-22 12:54:44,994 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 382 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:44,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 611 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-22 12:54:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 491. [2024-11-22 12:54:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 436 states have (on average 1.4220183486238531) internal successors, (620), 436 states have internal predecessors, (620), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:54:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 716 transitions. [2024-11-22 12:54:45,011 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 716 transitions. Word has length 137 [2024-11-22 12:54:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:45,011 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 716 transitions. [2024-11-22 12:54:45,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 716 transitions. [2024-11-22 12:54:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 12:54:45,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:45,013 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:45,024 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-22 12:54:45,213 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-22 12:54:45,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:45,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1604988632, now seen corresponding path program 1 times [2024-11-22 12:54:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:45,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167373450] [2024-11-22 12:54:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:45,215 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-22 12:54:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:45,216 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-22 12:54:45,216 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-22 12:54:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:45,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 12:54:45,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:45,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 17 treesize of output 9 [2024-11-22 12:54:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:45,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:45,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167373450] [2024-11-22 12:54:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167373450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:45,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:45,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:54:45,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645470721] [2024-11-22 12:54:45,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:45,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:54:45,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:45,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:54:45,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:54:45,704 INFO L87 Difference]: Start difference. First operand 491 states and 716 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:45,759 INFO L93 Difference]: Finished difference Result 981 states and 1430 transitions. [2024-11-22 12:54:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:54:45,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-22 12:54:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:45,763 INFO L225 Difference]: With dead ends: 981 [2024-11-22 12:54:45,763 INFO L226 Difference]: Without dead ends: 493 [2024-11-22 12:54:45,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 134 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-22 12:54:45,765 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 116 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:45,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 723 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-22 12:54:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2024-11-22 12:54:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 436 states have (on average 1.4197247706422018) internal successors, (619), 436 states have internal predecessors, (619), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:54:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 715 transitions. [2024-11-22 12:54:45,786 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 715 transitions. Word has length 137 [2024-11-22 12:54:45,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:45,786 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 715 transitions. [2024-11-22 12:54:45,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 715 transitions. [2024-11-22 12:54:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 12:54:45,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:45,789 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:45,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 12:54:45,989 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-22 12:54:45,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:45,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1089001780, now seen corresponding path program 1 times [2024-11-22 12:54:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:45,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670144250] [2024-11-22 12:54:45,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:45,991 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-22 12:54:45,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:45,993 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-22 12:54:45,994 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-22 12:54:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:46,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:54:46,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:46,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2024-11-22 12:54:46,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 12:54:46,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2024-11-22 12:54:46,532 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 40 treesize of output 28 [2024-11-22 12:54:46,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:54:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 12:54:46,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:54:46,638 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 40 treesize of output 36 [2024-11-22 12:54:46,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 12:54:46,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:54:46,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2024-11-22 12:54:46,871 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-22 12:54:46,872 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 20 treesize of output 19 [2024-11-22 12:54:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:54:46,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670144250] [2024-11-22 12:54:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670144250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:54:46,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:54:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-22 12:54:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480346703] [2024-11-22 12:54:46,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:54:46,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 12:54:46,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 12:54:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:54:46,910 INFO L87 Difference]: Start difference. First operand 491 states and 715 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:54:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:47,673 INFO L93 Difference]: Finished difference Result 803 states and 1164 transitions. [2024-11-22 12:54:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 12:54:47,677 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) Word has length 138 [2024-11-22 12:54:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:47,679 INFO L225 Difference]: With dead ends: 803 [2024-11-22 12:54:47,680 INFO L226 Difference]: Without dead ends: 508 [2024-11-22 12:54:47,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 12:54:47,682 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 1523 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:47,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1605 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:54:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-22 12:54:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 491. [2024-11-22 12:54:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 436 states have (on average 1.4174311926605505) internal successors, (618), 436 states have internal predecessors, (618), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:54:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 714 transitions. [2024-11-22 12:54:47,708 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 714 transitions. Word has length 138 [2024-11-22 12:54:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:47,708 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 714 transitions. [2024-11-22 12:54:47,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:54:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 714 transitions. [2024-11-22 12:54:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 12:54:47,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:47,710 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:47,720 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-22 12:54:47,910 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-22 12:54:47,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:47,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 842697300, now seen corresponding path program 1 times [2024-11-22 12:54:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:47,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472432149] [2024-11-22 12:54:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:47,912 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-22 12:54:47,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:47,915 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-22 12:54:47,915 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-22 12:54:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:48,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:54:48,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:48,363 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-22 12:54:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:48,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:48,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:48,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472432149] [2024-11-22 12:54:48,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472432149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:48,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:48,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:54:48,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343236017] [2024-11-22 12:54:48,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:48,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:54:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:54:48,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:54:48,373 INFO L87 Difference]: Start difference. First operand 491 states and 714 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:48,431 INFO L93 Difference]: Finished difference Result 1109 states and 1616 transitions. [2024-11-22 12:54:48,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:54:48,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-22 12:54:48,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:48,434 INFO L225 Difference]: With dead ends: 1109 [2024-11-22 12:54:48,435 INFO L226 Difference]: Without dead ends: 786 [2024-11-22 12:54:48,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 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-22 12:54:48,437 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 141 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 624 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.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:48,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 624 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:54:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-22 12:54:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 780. [2024-11-22 12:54:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 689 states have internal predecessors, (975), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-22 12:54:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1135 transitions. [2024-11-22 12:54:48,461 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1135 transitions. Word has length 138 [2024-11-22 12:54:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:48,462 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1135 transitions. [2024-11-22 12:54:48,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1135 transitions. [2024-11-22 12:54:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 12:54:48,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:48,463 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:48,473 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-22 12:54:48,667 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-22 12:54:48,667 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:48,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash 25048850, now seen corresponding path program 1 times [2024-11-22 12:54:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59487184] [2024-11-22 12:54:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:48,668 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-22 12:54:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:48,670 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-22 12:54:48,672 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-22 12:54:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:48,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:54:48,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:49,179 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 33 treesize of output 21 [2024-11-22 12:54:49,193 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-22 12:54:49,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:54:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 12:54:49,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:54:49,467 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-22 12:54:49,467 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 20 treesize of output 19 [2024-11-22 12:54:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:54:49,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:49,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59487184] [2024-11-22 12:54:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59487184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:54:49,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:54:49,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-11-22 12:54:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780808296] [2024-11-22 12:54:49,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:54:49,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 12:54:49,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 12:54:49,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:54:49,516 INFO L87 Difference]: Start difference. First operand 780 states and 1135 transitions. Second operand has 15 states, 13 states have (on average 5.923076923076923) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:54:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:50,003 INFO L93 Difference]: Finished difference Result 1407 states and 2042 transitions. [2024-11-22 12:54:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 12:54:50,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.923076923076923) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) Word has length 138 [2024-11-22 12:54:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:50,007 INFO L225 Difference]: With dead ends: 1407 [2024-11-22 12:54:50,007 INFO L226 Difference]: Without dead ends: 800 [2024-11-22 12:54:50,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2024-11-22 12:54:50,009 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1131 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:50,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 1034 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:54:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-22 12:54:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 780. [2024-11-22 12:54:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 689 states have (on average 1.4107402031930334) internal successors, (972), 689 states have internal predecessors, (972), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-22 12:54:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1132 transitions. [2024-11-22 12:54:50,034 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1132 transitions. Word has length 138 [2024-11-22 12:54:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:50,034 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1132 transitions. [2024-11-22 12:54:50,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.923076923076923) internal successors, (77), 15 states have internal predecessors, (77), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:54:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1132 transitions. [2024-11-22 12:54:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:50,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:50,035 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:50,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 (11)] Ended with exit code 0 [2024-11-22 12:54:50,236 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-22 12:54:50,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:50,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1945701522, now seen corresponding path program 1 times [2024-11-22 12:54:50,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:50,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17370946] [2024-11-22 12:54:50,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:50,237 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-22 12:54:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:50,238 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-22 12:54:50,239 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-22 12:54:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:50,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-22 12:54:50,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:52,949 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 27 treesize of output 23 [2024-11-22 12:54:53,250 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 31 treesize of output 23 [2024-11-22 12:54:53,359 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 42 treesize of output 26 [2024-11-22 12:54:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 26 proven. 397 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-22 12:54:53,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:54:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:54,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:54,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17370946] [2024-11-22 12:54:54,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17370946] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:54:54,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:54:54,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [33] total 39 [2024-11-22 12:54:54,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463607656] [2024-11-22 12:54:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:54,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:54:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:54,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:54:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2024-11-22 12:54:54,197 INFO L87 Difference]: Start difference. First operand 780 states and 1132 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:54,791 INFO L93 Difference]: Finished difference Result 2066 states and 2981 transitions. [2024-11-22 12:54:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:54:54,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:54:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:54,795 INFO L225 Difference]: With dead ends: 2066 [2024-11-22 12:54:54,795 INFO L226 Difference]: Without dead ends: 1289 [2024-11-22 12:54:54,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=139, Invalid=1753, Unknown=0, NotChecked=0, Total=1892 [2024-11-22 12:54:54,798 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 121 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:54,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1662 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:54:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-22 12:54:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1242. [2024-11-22 12:54:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1136 states have (on average 1.4225352112676057) internal successors, (1616), 1141 states have internal predecessors, (1616), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-22 12:54:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1796 transitions. [2024-11-22 12:54:54,832 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1796 transitions. Word has length 139 [2024-11-22 12:54:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:54,832 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1796 transitions. [2024-11-22 12:54:54,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1796 transitions. [2024-11-22 12:54:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:54,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:54,834 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:54,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 12:54:55,034 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-22 12:54:55,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:55,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1648201196, now seen corresponding path program 1 times [2024-11-22 12:54:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:55,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596842761] [2024-11-22 12:54:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:55,036 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-22 12:54:55,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:55,038 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-22 12:54:55,039 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-22 12:54:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:55,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:54:55,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:55,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 12:54:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:55,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:55,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596842761] [2024-11-22 12:54:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596842761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:55,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:55,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:54:55,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371780785] [2024-11-22 12:54:55,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:55,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:55,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:55,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:54:55,362 INFO L87 Difference]: Start difference. First operand 1242 states and 1796 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:55,497 INFO L93 Difference]: Finished difference Result 2583 states and 3711 transitions. [2024-11-22 12:54:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:54:55,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:54:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:55,503 INFO L225 Difference]: With dead ends: 2583 [2024-11-22 12:54:55,503 INFO L226 Difference]: Without dead ends: 1344 [2024-11-22 12:54:55,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:54:55,507 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 128 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:55,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 924 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-11-22 12:54:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1337. [2024-11-22 12:54:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1189 states have (on average 1.3986543313709) internal successors, (1663), 1195 states have internal predecessors, (1663), 122 states have call successors, (122), 25 states have call predecessors, (122), 25 states have return successors, (122), 116 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-22 12:54:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1907 transitions. [2024-11-22 12:54:55,552 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1907 transitions. Word has length 139 [2024-11-22 12:54:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:55,553 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1907 transitions. [2024-11-22 12:54:55,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1907 transitions. [2024-11-22 12:54:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:55,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:55,555 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:55,564 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 (13)] Forceful destruction successful, exit code 0 [2024-11-22 12:54:55,755 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-22 12:54:55,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1128053072, now seen corresponding path program 1 times [2024-11-22 12:54:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75803960] [2024-11-22 12:54:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:55,757 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-22 12:54:55,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:55,759 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-22 12:54:55,760 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-22 12:54:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:56,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:54:56,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:56,066 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 16 treesize of output 8 [2024-11-22 12:54:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:54:56,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:54:56,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:54:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75803960] [2024-11-22 12:54:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75803960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:54:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:54:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:54:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446621406] [2024-11-22 12:54:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:54:56,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:54:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:54:56,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:54:56,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:54:56,076 INFO L87 Difference]: Start difference. First operand 1337 states and 1907 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:54:56,192 INFO L93 Difference]: Finished difference Result 2693 states and 3825 transitions. [2024-11-22 12:54:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:54:56,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:54:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:54:56,198 INFO L225 Difference]: With dead ends: 2693 [2024-11-22 12:54:56,198 INFO L226 Difference]: Without dead ends: 1364 [2024-11-22 12:54:56,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:54:56,200 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 126 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:54:56,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1062 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:54:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-11-22 12:54:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1332. [2024-11-22 12:54:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1189 states have (on average 1.3944491169049622) internal successors, (1658), 1194 states have internal predecessors, (1658), 114 states have call successors, (114), 28 states have call predecessors, (114), 28 states have return successors, (114), 109 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-22 12:54:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1886 transitions. [2024-11-22 12:54:56,241 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1886 transitions. Word has length 139 [2024-11-22 12:54:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:54:56,241 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1886 transitions. [2024-11-22 12:54:56,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:54:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1886 transitions. [2024-11-22 12:54:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 12:54:56,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:54:56,242 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:54:56,251 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-22 12:54:56,443 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-22 12:54:56,443 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:54:56,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:54:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1829117650, now seen corresponding path program 1 times [2024-11-22 12:54:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:54:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634794233] [2024-11-22 12:54:56,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:54:56,444 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-22 12:54:56,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:54:56,445 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-22 12:54:56,446 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-22 12:54:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:54:56,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-22 12:54:56,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:54:59,038 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 26 treesize of output 22 [2024-11-22 12:54:59,290 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 30 treesize of output 22 [2024-11-22 12:54:59,386 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 41 treesize of output 25 [2024-11-22 12:54:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 23 proven. 393 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-22 12:54:59,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:55:00,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634794233] [2024-11-22 12:55:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634794233] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [33] total 39 [2024-11-22 12:55:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605470281] [2024-11-22 12:55:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:00,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:55:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:55:00,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2024-11-22 12:55:00,068 INFO L87 Difference]: Start difference. First operand 1332 states and 1886 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:55:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:00,544 INFO L93 Difference]: Finished difference Result 2707 states and 3816 transitions. [2024-11-22 12:55:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:55:00,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-22 12:55:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:00,549 INFO L225 Difference]: With dead ends: 2707 [2024-11-22 12:55:00,549 INFO L226 Difference]: Without dead ends: 1378 [2024-11-22 12:55:00,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=1753, Unknown=0, NotChecked=0, Total=1892 [2024-11-22 12:55:00,552 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 118 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 2350 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:00,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 2350 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:55:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-22 12:55:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1047. [2024-11-22 12:55:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 944 states have (on average 1.4014830508474576) internal successors, (1323), 945 states have internal predecessors, (1323), 82 states have call successors, (82), 20 states have call predecessors, (82), 20 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-22 12:55:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1487 transitions. [2024-11-22 12:55:00,598 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1487 transitions. Word has length 139 [2024-11-22 12:55:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1487 transitions. [2024-11-22 12:55:00,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:55:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1487 transitions. [2024-11-22 12:55:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 12:55:00,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:00,600 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:00,611 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 (15)] Ended with exit code 0 [2024-11-22 12:55:00,800 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-22 12:55:00,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:00,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash 31905336, now seen corresponding path program 1 times [2024-11-22 12:55:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:00,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726493131] [2024-11-22 12:55:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:00,802 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-22 12:55:00,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:00,803 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-22 12:55:00,803 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-22 12:55:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:01,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:55:01,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:01,279 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 33 treesize of output 21 [2024-11-22 12:55:01,293 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-22 12:55:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:55:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 12:55:01,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:01,547 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-22 12:55:01,548 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 20 treesize of output 19 [2024-11-22 12:55:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:55:01,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:01,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726493131] [2024-11-22 12:55:01,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726493131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:55:01,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:55:01,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-11-22 12:55:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857892321] [2024-11-22 12:55:01,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:55:01,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 12:55:01,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:01,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 12:55:01,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:55:01,588 INFO L87 Difference]: Start difference. First operand 1047 states and 1487 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:55:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:02,040 INFO L93 Difference]: Finished difference Result 1829 states and 2589 transitions. [2024-11-22 12:55:02,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 12:55:02,041 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) Word has length 140 [2024-11-22 12:55:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:02,045 INFO L225 Difference]: With dead ends: 1829 [2024-11-22 12:55:02,045 INFO L226 Difference]: Without dead ends: 1067 [2024-11-22 12:55:02,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2024-11-22 12:55:02,048 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 640 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:02,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1028 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:55:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-22 12:55:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 618. [2024-11-22 12:55:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 555 states have (on average 1.390990990990991) internal successors, (772), 556 states have internal predecessors, (772), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-22 12:55:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 872 transitions. [2024-11-22 12:55:02,086 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 872 transitions. Word has length 140 [2024-11-22 12:55:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:02,087 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 872 transitions. [2024-11-22 12:55:02,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:55:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 872 transitions. [2024-11-22 12:55:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 12:55:02,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:02,089 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:02,098 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 (16)] Ended with exit code 0 [2024-11-22 12:55:02,289 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 [2024-11-22 12:55:02,291 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:02,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1764056573, now seen corresponding path program 1 times [2024-11-22 12:55:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:02,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800606873] [2024-11-22 12:55:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:02,292 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-22 12:55:02,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:02,293 INFO L229 MonitoredProcess]: Starting monitored process 17 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-22 12:55:02,294 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 (17)] Waiting until timeout for monitored process [2024-11-22 12:55:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:02,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:55:02,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:55:02,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:02,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800606873] [2024-11-22 12:55:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800606873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:02,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:02,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:55:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729097616] [2024-11-22 12:55:02,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:02,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:02,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:02,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:55:02,603 INFO L87 Difference]: Start difference. First operand 618 states and 872 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:55:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:02,639 INFO L93 Difference]: Finished difference Result 1237 states and 1746 transitions. [2024-11-22 12:55:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:55:02,640 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-22 12:55:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:02,642 INFO L225 Difference]: With dead ends: 1237 [2024-11-22 12:55:02,643 INFO L226 Difference]: Without dead ends: 627 [2024-11-22 12:55:02,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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-22 12:55:02,644 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:02,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 824 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-22 12:55:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2024-11-22 12:55:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 564 states have (on average 1.3847517730496455) internal successors, (781), 565 states have internal predecessors, (781), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-22 12:55:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 881 transitions. [2024-11-22 12:55:02,665 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 881 transitions. Word has length 141 [2024-11-22 12:55:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:02,666 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 881 transitions. [2024-11-22 12:55:02,666 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:55:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 881 transitions. [2024-11-22 12:55:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 12:55:02,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:02,667 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:02,679 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 (17)] Ended with exit code 0 [2024-11-22 12:55:02,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-22 12:55:02,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:02,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:02,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1380781314, now seen corresponding path program 1 times [2024-11-22 12:55:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:02,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614779247] [2024-11-22 12:55:02,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:02,869 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-22 12:55:02,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:02,870 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-22 12:55:02,871 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-22 12:55:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:03,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 12:55:03,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:03,749 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 85 treesize of output 65 [2024-11-22 12:55:03,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2024-11-22 12:55:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 12:55:03,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:04,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:04,513 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 49 treesize of output 48 [2024-11-22 12:55:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:55:04,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614779247] [2024-11-22 12:55:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614779247] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:55:04,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:55:04,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-11-22 12:55:04,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931541985] [2024-11-22 12:55:04,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:55:04,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 12:55:04,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 12:55:04,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-22 12:55:04,620 INFO L87 Difference]: Start difference. First operand 627 states and 881 transitions. Second operand has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 18 states have internal predecessors, (135), 6 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-22 12:55:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:05,530 INFO L93 Difference]: Finished difference Result 1977 states and 2775 transitions. [2024-11-22 12:55:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 12:55:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 18 states have internal predecessors, (135), 6 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) Word has length 143 [2024-11-22 12:55:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:05,538 INFO L225 Difference]: With dead ends: 1977 [2024-11-22 12:55:05,539 INFO L226 Difference]: Without dead ends: 1358 [2024-11-22 12:55:05,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 12:55:05,541 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 812 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:05,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2540 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:55:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-11-22 12:55:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1225. [2024-11-22 12:55:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1122 states have (on average 1.4001782531194296) internal successors, (1571), 1123 states have internal predecessors, (1571), 82 states have call successors, (82), 20 states have call predecessors, (82), 20 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-22 12:55:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1735 transitions. [2024-11-22 12:55:05,581 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1735 transitions. Word has length 143 [2024-11-22 12:55:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:05,582 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1735 transitions. [2024-11-22 12:55:05,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 18 states have internal predecessors, (135), 6 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-22 12:55:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1735 transitions. [2024-11-22 12:55:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-22 12:55:05,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:05,583 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:05,593 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 (18)] Ended with exit code 0 [2024-11-22 12:55:05,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-22 12:55:05,784 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:05,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2079532628, now seen corresponding path program 1 times [2024-11-22 12:55:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:05,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142804166] [2024-11-22 12:55:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:05,788 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-22 12:55:05,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:05,789 INFO L229 MonitoredProcess]: Starting monitored process 19 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-22 12:55:05,790 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 (19)] Waiting until timeout for monitored process [2024-11-22 12:55:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:06,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 12:55:06,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:07,201 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-22 12:55:07,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:07,570 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 191 treesize of output 121 [2024-11-22 12:55:07,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:07,573 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 1 case distinctions, treesize of input 258 treesize of output 138 [2024-11-22 12:55:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-22 12:55:07,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:07,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142804166] [2024-11-22 12:55:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142804166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [475658421] [2024-11-22 12:55:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:07,926 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:55:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:55:07,928 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 12:55:07,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-22 12:55:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:09,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 12:55:09,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:10,227 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-22 12:55:11,196 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-22 12:55:11,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:11,725 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 1 case distinctions, treesize of input 177 treesize of output 121 [2024-11-22 12:55:11,728 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 274 treesize of output 146 [2024-11-22 12:55:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-22 12:55:11,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:11,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [475658421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:11,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:55:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2024-11-22 12:55:11,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057999948] [2024-11-22 12:55:11,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:55:11,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 12:55:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 12:55:11,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-22 12:55:11,886 INFO L87 Difference]: Start difference. First operand 1225 states and 1735 transitions. Second operand has 18 states, 18 states have (on average 7.388888888888889) internal successors, (133), 17 states have internal predecessors, (133), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:55:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:19,265 INFO L93 Difference]: Finished difference Result 3104 states and 4333 transitions. [2024-11-22 12:55:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 12:55:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.388888888888889) internal successors, (133), 17 states have internal predecessors, (133), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 143 [2024-11-22 12:55:19,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:19,275 INFO L225 Difference]: With dead ends: 3104 [2024-11-22 12:55:19,275 INFO L226 Difference]: Without dead ends: 3102 [2024-11-22 12:55:19,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2024-11-22 12:55:19,278 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1019 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:19,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2159 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-22 12:55:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2024-11-22 12:55:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3088. [2024-11-22 12:55:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 2795 states have (on average 1.3778175313059033) internal successors, (3851), 2806 states have internal predecessors, (3851), 232 states have call successors, (232), 60 states have call predecessors, (232), 60 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) [2024-11-22 12:55:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 4315 transitions. [2024-11-22 12:55:19,458 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 4315 transitions. Word has length 143 [2024-11-22 12:55:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:19,462 INFO L471 AbstractCegarLoop]: Abstraction has 3088 states and 4315 transitions. [2024-11-22 12:55:19,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.388888888888889) internal successors, (133), 17 states have internal predecessors, (133), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-22 12:55:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 4315 transitions. [2024-11-22 12:55:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-22 12:55:19,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:19,463 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:19,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:19,675 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 (19)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:19,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /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-22 12:55:19,864 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:19,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 55788388, now seen corresponding path program 1 times [2024-11-22 12:55:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:19,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202018682] [2024-11-22 12:55:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:19,865 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-22 12:55:19,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:19,866 INFO L229 MonitoredProcess]: Starting monitored process 21 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-22 12:55:19,867 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 (21)] Waiting until timeout for monitored process [2024-11-22 12:55:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:20,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 12:55:20,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:20,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:20,396 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 157 treesize of output 67 [2024-11-22 12:55:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:55:20,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:20,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:20,609 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 101 treesize of output 1 [2024-11-22 12:55:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:55:20,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202018682] [2024-11-22 12:55:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202018682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:55:20,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:55:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-22 12:55:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318283037] [2024-11-22 12:55:20,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:55:20,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 12:55:20,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:20,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 12:55:20,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:55:20,650 INFO L87 Difference]: Start difference. First operand 3088 states and 4315 transitions. Second operand has 12 states, 11 states have (on average 9.818181818181818) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-22 12:55:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:22,606 INFO L93 Difference]: Finished difference Result 6275 states and 8737 transitions. [2024-11-22 12:55:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 12:55:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.818181818181818) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) Word has length 145 [2024-11-22 12:55:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:22,616 INFO L225 Difference]: With dead ends: 6275 [2024-11-22 12:55:22,616 INFO L226 Difference]: Without dead ends: 3140 [2024-11-22 12:55:22,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-22 12:55:22,622 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 171 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:22,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 659 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 12:55:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2024-11-22 12:55:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3078. [2024-11-22 12:55:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2785 states have (on average 1.3755834829443447) internal successors, (3831), 2796 states have internal predecessors, (3831), 232 states have call successors, (232), 60 states have call predecessors, (232), 60 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) [2024-11-22 12:55:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4295 transitions. [2024-11-22 12:55:22,799 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4295 transitions. Word has length 145 [2024-11-22 12:55:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:22,799 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4295 transitions. [2024-11-22 12:55:22,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.818181818181818) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-22 12:55:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4295 transitions. [2024-11-22 12:55:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-22 12:55:22,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:22,801 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:22,810 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 (21)] Ended with exit code 0 [2024-11-22 12:55:23,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-22 12:55:23,002 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:23,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2069153416, now seen corresponding path program 1 times [2024-11-22 12:55:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:23,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569134150] [2024-11-22 12:55:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:23,003 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-22 12:55:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:23,004 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-22 12:55:23,004 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-22 12:55:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:23,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 12:55:23,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:23,441 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-22 12:55:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 12:55:23,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:23,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:23,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569134150] [2024-11-22 12:55:23,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569134150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:23,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:23,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:55:23,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38451228] [2024-11-22 12:55:23,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:23,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:55:23,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:55:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:55:23,447 INFO L87 Difference]: Start difference. First operand 3078 states and 4295 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:55:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:23,601 INFO L93 Difference]: Finished difference Result 6158 states and 8593 transitions. [2024-11-22 12:55:23,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:55:23,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 145 [2024-11-22 12:55:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:23,610 INFO L225 Difference]: With dead ends: 6158 [2024-11-22 12:55:23,611 INFO L226 Difference]: Without dead ends: 3088 [2024-11-22 12:55:23,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 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-22 12:55:23,615 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 119 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:23,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 611 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2024-11-22 12:55:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3078. [2024-11-22 12:55:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2785 states have (on average 1.3723518850987433) internal successors, (3822), 2796 states have internal predecessors, (3822), 232 states have call successors, (232), 60 states have call predecessors, (232), 60 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) [2024-11-22 12:55:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4286 transitions. [2024-11-22 12:55:23,782 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4286 transitions. Word has length 145 [2024-11-22 12:55:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:23,783 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4286 transitions. [2024-11-22 12:55:23,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 12:55:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4286 transitions. [2024-11-22 12:55:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-22 12:55:23,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:23,786 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:23,795 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 (22)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:23,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-22 12:55:23,986 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:23,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1676126406, now seen corresponding path program 1 times [2024-11-22 12:55:23,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:23,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594184843] [2024-11-22 12:55:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:23,987 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-22 12:55:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:23,988 INFO L229 MonitoredProcess]: Starting monitored process 23 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-22 12:55:23,990 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 (23)] Waiting until timeout for monitored process [2024-11-22 12:55:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:24,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 12:55:24,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:24,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 12:55:24,807 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 33 treesize of output 21 [2024-11-22 12:55:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-22 12:55:24,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:25,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:25,841 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 60 treesize of output 59 [2024-11-22 12:55:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 12:55:25,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594184843] [2024-11-22 12:55:25,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594184843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 12:55:25,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:55:25,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-22 12:55:25,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794323702] [2024-11-22 12:55:25,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:55:25,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 12:55:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 12:55:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-22 12:55:25,948 INFO L87 Difference]: Start difference. First operand 3078 states and 4286 transitions. Second operand has 23 states, 21 states have (on average 6.619047619047619) internal successors, (139), 22 states have internal predecessors, (139), 6 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-22 12:55:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:27,215 INFO L93 Difference]: Finished difference Result 6527 states and 9046 transitions. [2024-11-22 12:55:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-22 12:55:27,216 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.619047619047619) internal successors, (139), 22 states have internal predecessors, (139), 6 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) Word has length 145 [2024-11-22 12:55:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:27,226 INFO L225 Difference]: With dead ends: 6527 [2024-11-22 12:55:27,226 INFO L226 Difference]: Without dead ends: 3457 [2024-11-22 12:55:27,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1595, Unknown=0, NotChecked=0, Total=1892 [2024-11-22 12:55:27,230 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 732 mSDsluCounter, 3069 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 3247 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:27,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 3247 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 12:55:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2024-11-22 12:55:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3066. [2024-11-22 12:55:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2773 states have (on average 1.3739632167327804) internal successors, (3810), 2784 states have internal predecessors, (3810), 232 states have call successors, (232), 60 states have call predecessors, (232), 60 states have return successors, (232), 221 states have call predecessors, (232), 232 states have call successors, (232) [2024-11-22 12:55:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4274 transitions. [2024-11-22 12:55:27,376 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4274 transitions. Word has length 145 [2024-11-22 12:55:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:27,377 INFO L471 AbstractCegarLoop]: Abstraction has 3066 states and 4274 transitions. [2024-11-22 12:55:27,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.619047619047619) internal successors, (139), 22 states have internal predecessors, (139), 6 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-22 12:55:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4274 transitions. [2024-11-22 12:55:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-22 12:55:27,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:27,378 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:27,389 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 (23)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:27,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-22 12:55:27,579 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:27,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 536868646, now seen corresponding path program 1 times [2024-11-22 12:55:27,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:27,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990928442] [2024-11-22 12:55:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:27,580 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-22 12:55:27,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:27,581 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-22 12:55:27,582 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-22 12:55:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:27,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 12:55:27,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:29,126 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-22 12:55:29,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:29,549 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 191 treesize of output 121 [2024-11-22 12:55:29,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:29,555 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 1 case distinctions, treesize of input 256 treesize of output 136 [2024-11-22 12:55:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 1 proven. 115 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:55:29,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:29,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:29,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990928442] [2024-11-22 12:55:29,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990928442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:29,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1636176295] [2024-11-22 12:55:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:29,929 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 12:55:29,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 12:55:29,931 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-22 12:55:29,932 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-22 12:55:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:31,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-22 12:55:31,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:32,477 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-22 12:55:33,372 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-22 12:55:33,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 12:55:33,833 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 1 case distinctions, treesize of input 177 treesize of output 121 [2024-11-22 12:55:33,835 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 256 treesize of output 136 [2024-11-22 12:55:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 1 proven. 115 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 12:55:33,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:34,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1636176295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:34,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 12:55:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-22 12:55:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856691835] [2024-11-22 12:55:34,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 12:55:34,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 12:55:34,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:34,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 12:55:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-22 12:55:34,005 INFO L87 Difference]: Start difference. First operand 3066 states and 4274 transitions. Second operand has 24 states, 22 states have (on average 6.5) internal successors, (143), 21 states have internal predecessors, (143), 6 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-22 12:55:37,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []