./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.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 e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:56:07,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:56:07,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:56:07,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:56:07,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:56:07,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:56:07,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:56:07,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:56:07,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:56:07,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:56:07,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:56:07,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:56:07,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:56:07,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:56:07,931 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:56:07,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:56:07,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:56:07,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:56:07,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:56:07,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:56:07,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:56:07,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:56:07,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:56:07,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:56:07,935 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:56:07,935 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:56:07,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:56:07,936 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:56:07,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:56:07,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:56:07,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:56:07,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:56:07,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:56:07,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:56:07,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:56:07,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:56:07,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:56:07,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:56:07,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:56:07,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:56:07,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:56:07,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:56:07,940 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 -> e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 [2024-11-19 00:56:08,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:56:08,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:56:08,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:56:08,221 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:56:08,221 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:56:08,223 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-4.i [2024-11-19 00:56:09,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:56:09,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:56:09,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2024-11-19 00:56:09,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edfc3f73/f7d0e600d73b44baa9036eb83eedbcc2/FLAGb4df1b7b8 [2024-11-19 00:56:10,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edfc3f73/f7d0e600d73b44baa9036eb83eedbcc2 [2024-11-19 00:56:10,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:56:10,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:56:10,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:56:10,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:56:10,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:56:10,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236e629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10, skipping insertion in model container [2024-11-19 00:56:10,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:56:10,547 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-4.i[915,928] [2024-11-19 00:56:10,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:56:10,632 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:56:10,644 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-4.i[915,928] [2024-11-19 00:56:10,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:56:10,697 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:56:10,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10 WrapperNode [2024-11-19 00:56:10,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:56:10,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:56:10,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:56:10,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:56:10,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,763 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 525 [2024-11-19 00:56:10,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:56:10,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:56:10,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:56:10,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:56:10,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,869 INFO L175 MemorySlicer]: Split 130 memory accesses to 14 slices as follows [2, 3, 11, 9, 13, 18, 14, 6, 8, 8, 11, 11, 6, 10]. 14 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2024-11-19 00:56:10,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:56:10,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:56:10,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:56:10,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:56:10,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (1/1) ... [2024-11-19 00:56:10,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:56:10,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:10,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:56:10,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:56:11,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:56:11,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:56:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:56:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:56:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:56:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:56:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:56:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:56:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 00:56:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 00:56:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 00:56:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-19 00:56:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:56:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 00:56:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 00:56:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 00:56:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 00:56:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 00:56:11,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 00:56:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-19 00:56:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:56:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:56:11,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:56:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:56:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:56:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:56:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:56:11,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 00:56:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 00:56:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 00:56:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-19 00:56:11,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-19 00:56:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-19 00:56:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-19 00:56:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:56:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:56:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:56:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:56:11,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:56:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:56:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:56:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 00:56:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 00:56:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 00:56:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 00:56:11,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 00:56:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 00:56:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-19 00:56:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:56:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:56:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:56:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:56:11,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:56:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:56:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:56:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 00:56:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 00:56:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 00:56:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-19 00:56:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-19 00:56:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-19 00:56:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-19 00:56:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:56:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:56:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:56:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:56:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:56:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:56:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:56:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:56:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:56:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 00:56:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 00:56:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 00:56:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 00:56:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 00:56:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 00:56:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 00:56:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:56:11,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:56:11,246 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:56:11,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:56:11,805 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-19 00:56:11,805 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:56:11,823 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:56:11,823 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:56:11,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:56:11 BoogieIcfgContainer [2024-11-19 00:56:11,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:56:11,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:56:11,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:56:11,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:56:11,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:56:10" (1/3) ... [2024-11-19 00:56:11,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b87764f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:56:11, skipping insertion in model container [2024-11-19 00:56:11,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:56:10" (2/3) ... [2024-11-19 00:56:11,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b87764f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:56:11, skipping insertion in model container [2024-11-19 00:56:11,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:56:11" (3/3) ... [2024-11-19 00:56:11,834 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-4.i [2024-11-19 00:56:11,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:56:11,850 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:56:11,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:56:11,917 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;@60d8ebe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:56:11,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:56:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:56:11,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:11,937 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:11,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1790010152, now seen corresponding path program 1 times [2024-11-19 00:56:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149388680] [2024-11-19 00:56:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 00:56:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:12,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149388680] [2024-11-19 00:56:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149388680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662418775] [2024-11-19 00:56:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:12,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:12,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:56:12,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:56:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:12,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:56:12,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 00:56:12,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662418775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:12,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:12,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:56:12,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246067652] [2024-11-19 00:56:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:12,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:56:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:12,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:56:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:56:12,752 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:56:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:12,793 INFO L93 Difference]: Finished difference Result 213 states and 331 transitions. [2024-11-19 00:56:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:56:12,797 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-19 00:56:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:12,806 INFO L225 Difference]: With dead ends: 213 [2024-11-19 00:56:12,806 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 00:56:12,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:56:12,815 INFO L432 NwaCegarLoop]: 154 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, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:12,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 00:56:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 00:56:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-19 00:56:12,874 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2024-11-19 00:56:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:12,874 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-19 00:56:12,875 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:56:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-19 00:56:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:56:12,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:12,879 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:12,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:13,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:56:13,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:13,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1285386362, now seen corresponding path program 1 times [2024-11-19 00:56:13,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:13,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282588523] [2024-11-19 00:56:13,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:13,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282588523] [2024-11-19 00:56:13,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282588523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:13,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:13,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:56:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98150014] [2024-11-19 00:56:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:13,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:56:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:13,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:56:13,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:56:13,463 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:56:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:13,510 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2024-11-19 00:56:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:56:13,511 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-19 00:56:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:13,513 INFO L225 Difference]: With dead ends: 211 [2024-11-19 00:56:13,513 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 00:56:13,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:56:13,519 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:13,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 00:56:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 00:56:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-19 00:56:13,538 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2024-11-19 00:56:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:13,539 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-19 00:56:13,540 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:56:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-19 00:56:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:56:13,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:13,543 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:13,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:56:13,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:13,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:13,545 INFO L85 PathProgramCache]: Analyzing trace with hash 398163516, now seen corresponding path program 1 times [2024-11-19 00:56:13,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:13,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775627023] [2024-11-19 00:56:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:13,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775627023] [2024-11-19 00:56:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775627023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:13,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:56:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023120654] [2024-11-19 00:56:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:13,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:56:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:13,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:56:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:56:13,770 INFO L87 Difference]: Start difference. First operand 108 states and 156 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:13,813 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-19 00:56:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:56:13,814 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-19 00:56:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:13,817 INFO L225 Difference]: With dead ends: 216 [2024-11-19 00:56:13,819 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:56:13,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:56:13,821 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:13,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:56:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-19 00:56:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-19 00:56:13,839 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2024-11-19 00:56:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:13,841 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-19 00:56:13,841 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-19 00:56:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:56:13,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:13,844 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:13,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:56:13,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:13,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash 400010558, now seen corresponding path program 1 times [2024-11-19 00:56:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969616047] [2024-11-19 00:56:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:15,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969616047] [2024-11-19 00:56:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969616047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:15,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:15,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854303063] [2024-11-19 00:56:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:15,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:15,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:15,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:15,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:15,495 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:16,154 INFO L93 Difference]: Finished difference Result 360 states and 514 transitions. [2024-11-19 00:56:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:56:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 130 [2024-11-19 00:56:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:16,157 INFO L225 Difference]: With dead ends: 360 [2024-11-19 00:56:16,157 INFO L226 Difference]: Without dead ends: 253 [2024-11-19 00:56:16,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:56:16,161 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 656 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:16,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1095 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:56:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-19 00:56:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 230. [2024-11-19 00:56:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.3526315789473684) internal successors, (257), 192 states have internal predecessors, (257), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 00:56:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 327 transitions. [2024-11-19 00:56:16,200 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 327 transitions. Word has length 130 [2024-11-19 00:56:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:16,201 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 327 transitions. [2024-11-19 00:56:16,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 327 transitions. [2024-11-19 00:56:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:56:16,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:16,207 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:16,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:56:16,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1101075136, now seen corresponding path program 1 times [2024-11-19 00:56:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510430821] [2024-11-19 00:56:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 00:56:16,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510430821] [2024-11-19 00:56:16,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510430821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840498252] [2024-11-19 00:56:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:16,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:16,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:16,413 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-19 00:56:16,415 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-19 00:56:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:16,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:56:16,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:16,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840498252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:16,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 00:56:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113003363] [2024-11-19 00:56:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:16,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:56:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:16,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:56:16,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:16,751 INFO L87 Difference]: Start difference. First operand 230 states and 327 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:16,790 INFO L93 Difference]: Finished difference Result 446 states and 638 transitions. [2024-11-19 00:56:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:56:16,791 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-19 00:56:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:16,797 INFO L225 Difference]: With dead ends: 446 [2024-11-19 00:56:16,797 INFO L226 Difference]: Without dead ends: 234 [2024-11-19 00:56:16,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-19 00:56:16,800 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:16,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-19 00:56:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-19 00:56:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 196 states have internal predecessors, (261), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 00:56:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 331 transitions. [2024-11-19 00:56:16,830 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 331 transitions. Word has length 130 [2024-11-19 00:56:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:16,830 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 331 transitions. [2024-11-19 00:56:16,830 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 331 transitions. [2024-11-19 00:56:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:56:16,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:16,833 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:16,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:56:17,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:17,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:17,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash 822712384, now seen corresponding path program 1 times [2024-11-19 00:56:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:17,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795541090] [2024-11-19 00:56:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:17,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:17,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795541090] [2024-11-19 00:56:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795541090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681762229] [2024-11-19 00:56:17,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:17,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:17,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:17,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:17,533 INFO L87 Difference]: Start difference. First operand 234 states and 331 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:17,640 INFO L93 Difference]: Finished difference Result 518 states and 739 transitions. [2024-11-19 00:56:17,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:17,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-19 00:56:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:17,643 INFO L225 Difference]: With dead ends: 518 [2024-11-19 00:56:17,643 INFO L226 Difference]: Without dead ends: 302 [2024-11-19 00:56:17,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:17,645 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 148 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:17,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 814 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-19 00:56:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 221. [2024-11-19 00:56:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 187 states have (on average 1.358288770053476) internal successors, (254), 188 states have internal predecessors, (254), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 314 transitions. [2024-11-19 00:56:17,669 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 314 transitions. Word has length 130 [2024-11-19 00:56:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:17,670 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 314 transitions. [2024-11-19 00:56:17,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 314 transitions. [2024-11-19 00:56:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 00:56:17,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:17,673 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:17,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:56:17,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:17,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash -993277358, now seen corresponding path program 1 times [2024-11-19 00:56:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149643261] [2024-11-19 00:56:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 00:56:17,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:17,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149643261] [2024-11-19 00:56:17,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149643261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:17,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210082606] [2024-11-19 00:56:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:17,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:17,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:17,905 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-19 00:56:17,906 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-19 00:56:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:18,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:56:18,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:18,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:56:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210082606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:18,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:18,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 00:56:18,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016826786] [2024-11-19 00:56:18,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:18,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:18,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:56:18,229 INFO L87 Difference]: Start difference. First operand 221 states and 314 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:18,269 INFO L93 Difference]: Finished difference Result 445 states and 633 transitions. [2024-11-19 00:56:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:18,270 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 00:56:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:18,272 INFO L225 Difference]: With dead ends: 445 [2024-11-19 00:56:18,272 INFO L226 Difference]: Without dead ends: 227 [2024-11-19 00:56:18,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 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-19 00:56:18,273 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:18,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:56:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-19 00:56:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2024-11-19 00:56:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 190 states have internal predecessors, (256), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 316 transitions. [2024-11-19 00:56:18,294 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 316 transitions. Word has length 132 [2024-11-19 00:56:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:18,295 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 316 transitions. [2024-11-19 00:56:18,296 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2024-11-19 00:56:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:18,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:18,297 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:18,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:56:18,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:18,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:18,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1160107863, now seen corresponding path program 1 times [2024-11-19 00:56:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179096152] [2024-11-19 00:56:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179096152] [2024-11-19 00:56:19,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179096152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:19,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:19,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:19,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714480009] [2024-11-19 00:56:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:19,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:19,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:19,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:19,390 INFO L87 Difference]: Start difference. First operand 223 states and 316 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:19,978 INFO L93 Difference]: Finished difference Result 469 states and 661 transitions. [2024-11-19 00:56:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:56:19,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-19 00:56:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:19,982 INFO L225 Difference]: With dead ends: 469 [2024-11-19 00:56:19,983 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 00:56:19,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:56:19,985 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 428 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:19,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 815 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:56:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 00:56:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 223. [2024-11-19 00:56:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 190 states have internal predecessors, (255), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 315 transitions. [2024-11-19 00:56:20,017 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 315 transitions. Word has length 134 [2024-11-19 00:56:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:20,017 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 315 transitions. [2024-11-19 00:56:20,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 315 transitions. [2024-11-19 00:56:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:20,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:20,020 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:20,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:56:20,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:20,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash -119755815, now seen corresponding path program 1 times [2024-11-19 00:56:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506371803] [2024-11-19 00:56:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:20,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:20,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:20,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506371803] [2024-11-19 00:56:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506371803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:20,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:20,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:20,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596003934] [2024-11-19 00:56:20,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:20,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:20,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:20,889 INFO L87 Difference]: Start difference. First operand 223 states and 315 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:21,043 INFO L93 Difference]: Finished difference Result 503 states and 706 transitions. [2024-11-19 00:56:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:21,044 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:21,046 INFO L225 Difference]: With dead ends: 503 [2024-11-19 00:56:21,046 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 00:56:21,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:21,048 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 36 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:21,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 555 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 00:56:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 227. [2024-11-19 00:56:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.3419689119170986) internal successors, (259), 194 states have internal predecessors, (259), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2024-11-19 00:56:21,070 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 134 [2024-11-19 00:56:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2024-11-19 00:56:21,070 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2024-11-19 00:56:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:21,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:21,072 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:21,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:56:21,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:21,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash 459215189, now seen corresponding path program 1 times [2024-11-19 00:56:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:21,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933645878] [2024-11-19 00:56:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:21,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:21,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:21,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933645878] [2024-11-19 00:56:21,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933645878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:21,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:21,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:21,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117750372] [2024-11-19 00:56:21,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:21,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:21,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:21,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:21,707 INFO L87 Difference]: Start difference. First operand 227 states and 319 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:22,241 INFO L93 Difference]: Finished difference Result 499 states and 700 transitions. [2024-11-19 00:56:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:22,243 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:22,245 INFO L225 Difference]: With dead ends: 499 [2024-11-19 00:56:22,245 INFO L226 Difference]: Without dead ends: 275 [2024-11-19 00:56:22,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:22,248 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 47 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:22,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 566 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:56:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-19 00:56:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 253. [2024-11-19 00:56:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 220 states have internal predecessors, (294), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 354 transitions. [2024-11-19 00:56:22,279 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 354 transitions. Word has length 134 [2024-11-19 00:56:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:22,279 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 354 transitions. [2024-11-19 00:56:22,280 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 354 transitions. [2024-11-19 00:56:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:22,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:22,282 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:22,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:56:22,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:22,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash 859645068, now seen corresponding path program 1 times [2024-11-19 00:56:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454854803] [2024-11-19 00:56:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:22,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454854803] [2024-11-19 00:56:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454854803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:23,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:23,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142030204] [2024-11-19 00:56:23,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:23,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:23,153 INFO L87 Difference]: Start difference. First operand 253 states and 354 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:23,524 INFO L93 Difference]: Finished difference Result 525 states and 731 transitions. [2024-11-19 00:56:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:56:23,524 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:23,526 INFO L225 Difference]: With dead ends: 525 [2024-11-19 00:56:23,526 INFO L226 Difference]: Without dead ends: 275 [2024-11-19 00:56:23,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:56:23,528 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 69 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:23,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1289 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-19 00:56:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2024-11-19 00:56:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 223 states have (on average 1.336322869955157) internal successors, (298), 224 states have internal predecessors, (298), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 358 transitions. [2024-11-19 00:56:23,548 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 358 transitions. Word has length 134 [2024-11-19 00:56:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:23,548 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 358 transitions. [2024-11-19 00:56:23,549 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 358 transitions. [2024-11-19 00:56:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:23,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:23,550 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:23,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:56:23,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:23,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1560709646, now seen corresponding path program 1 times [2024-11-19 00:56:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998383141] [2024-11-19 00:56:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:24,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998383141] [2024-11-19 00:56:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998383141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:24,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:56:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941062366] [2024-11-19 00:56:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:24,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:56:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:24,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:56:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:24,138 INFO L87 Difference]: Start difference. First operand 257 states and 358 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:24,446 INFO L93 Difference]: Finished difference Result 523 states and 726 transitions. [2024-11-19 00:56:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-19 00:56:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:24,449 INFO L225 Difference]: With dead ends: 523 [2024-11-19 00:56:24,449 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 00:56:24,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:56:24,450 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 395 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:24,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 633 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 00:56:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2024-11-19 00:56:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 228 states have (on average 1.3245614035087718) internal successors, (302), 230 states have internal predecessors, (302), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:56:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 368 transitions. [2024-11-19 00:56:24,495 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 368 transitions. Word has length 134 [2024-11-19 00:56:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:24,495 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 368 transitions. [2024-11-19 00:56:24,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 368 transitions. [2024-11-19 00:56:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:24,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:24,497 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:24,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:56:24,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1000193678, now seen corresponding path program 1 times [2024-11-19 00:56:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525110452] [2024-11-19 00:56:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:24,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:24,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525110452] [2024-11-19 00:56:24,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525110452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:24,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:24,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891157815] [2024-11-19 00:56:24,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:24,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:24,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:24,782 INFO L87 Difference]: Start difference. First operand 266 states and 368 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:24,929 INFO L93 Difference]: Finished difference Result 559 states and 767 transitions. [2024-11-19 00:56:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:24,930 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:24,932 INFO L225 Difference]: With dead ends: 559 [2024-11-19 00:56:24,932 INFO L226 Difference]: Without dead ends: 303 [2024-11-19 00:56:24,932 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-19 00:56:24,933 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 59 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:24,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 647 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-19 00:56:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2024-11-19 00:56:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 249 states have (on average 1.321285140562249) internal successors, (329), 251 states have internal predecessors, (329), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:56:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2024-11-19 00:56:24,959 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 134 [2024-11-19 00:56:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:24,959 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2024-11-19 00:56:24,959 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2024-11-19 00:56:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:24,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:24,961 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:24,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:56:24,961 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:24,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1701258256, now seen corresponding path program 1 times [2024-11-19 00:56:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:24,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263674240] [2024-11-19 00:56:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:25,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263674240] [2024-11-19 00:56:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263674240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:25,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:25,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777997375] [2024-11-19 00:56:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:25,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:25,890 INFO L87 Difference]: Start difference. First operand 288 states and 395 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:26,273 INFO L93 Difference]: Finished difference Result 590 states and 806 transitions. [2024-11-19 00:56:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:56:26,274 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:26,275 INFO L225 Difference]: With dead ends: 590 [2024-11-19 00:56:26,275 INFO L226 Difference]: Without dead ends: 305 [2024-11-19 00:56:26,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:56:26,277 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 62 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:26,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1493 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-19 00:56:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2024-11-19 00:56:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 251 states have (on average 1.3187250996015936) internal successors, (331), 253 states have internal predecessors, (331), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:56:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2024-11-19 00:56:26,304 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 134 [2024-11-19 00:56:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:26,304 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2024-11-19 00:56:26,304 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2024-11-19 00:56:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:26,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:26,306 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:56:26,306 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1996854690, now seen corresponding path program 1 times [2024-11-19 00:56:26,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:26,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42360475] [2024-11-19 00:56:26,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42360475] [2024-11-19 00:56:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42360475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:26,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807882706] [2024-11-19 00:56:26,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:26,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:26,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:26,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:26,975 INFO L87 Difference]: Start difference. First operand 290 states and 397 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:27,336 INFO L93 Difference]: Finished difference Result 656 states and 894 transitions. [2024-11-19 00:56:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:56:27,336 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:27,338 INFO L225 Difference]: With dead ends: 656 [2024-11-19 00:56:27,338 INFO L226 Difference]: Without dead ends: 369 [2024-11-19 00:56:27,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 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-19 00:56:27,341 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 70 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:27,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1441 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-19 00:56:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 325. [2024-11-19 00:56:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 286 states have (on average 1.3286713286713288) internal successors, (380), 288 states have internal predecessors, (380), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:56:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 446 transitions. [2024-11-19 00:56:27,367 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 446 transitions. Word has length 134 [2024-11-19 00:56:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:27,368 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 446 transitions. [2024-11-19 00:56:27,368 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 446 transitions. [2024-11-19 00:56:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:27,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:27,369 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:27,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:56:27,370 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:27,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:27,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1295790112, now seen corresponding path program 1 times [2024-11-19 00:56:27,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:27,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716672512] [2024-11-19 00:56:27,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:27,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:27,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:27,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716672512] [2024-11-19 00:56:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716672512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:56:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985538472] [2024-11-19 00:56:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:27,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:56:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:27,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:56:27,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:27,815 INFO L87 Difference]: Start difference. First operand 325 states and 446 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:28,156 INFO L93 Difference]: Finished difference Result 678 states and 927 transitions. [2024-11-19 00:56:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-19 00:56:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:28,159 INFO L225 Difference]: With dead ends: 678 [2024-11-19 00:56:28,159 INFO L226 Difference]: Without dead ends: 356 [2024-11-19 00:56:28,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:56:28,161 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 334 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:28,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 757 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:56:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-19 00:56:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 324. [2024-11-19 00:56:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 285 states have (on average 1.3263157894736841) internal successors, (378), 287 states have internal predecessors, (378), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:56:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2024-11-19 00:56:28,188 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 134 [2024-11-19 00:56:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:28,188 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2024-11-19 00:56:28,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2024-11-19 00:56:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:28,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:28,190 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:28,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:56:28,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:28,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1596424811, now seen corresponding path program 1 times [2024-11-19 00:56:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206770860] [2024-11-19 00:56:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:29,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206770860] [2024-11-19 00:56:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206770860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:29,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:29,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:56:29,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450744972] [2024-11-19 00:56:29,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:29,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:56:29,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:29,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:56:29,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:29,153 INFO L87 Difference]: Start difference. First operand 324 states and 444 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:29,717 INFO L93 Difference]: Finished difference Result 662 states and 905 transitions. [2024-11-19 00:56:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:56:29,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:29,720 INFO L225 Difference]: With dead ends: 662 [2024-11-19 00:56:29,720 INFO L226 Difference]: Without dead ends: 341 [2024-11-19 00:56:29,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:29,721 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 263 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:29,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 610 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:56:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-19 00:56:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 319. [2024-11-19 00:56:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 280 states have (on average 1.3178571428571428) internal successors, (369), 282 states have internal predecessors, (369), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-19 00:56:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 435 transitions. [2024-11-19 00:56:29,756 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 435 transitions. Word has length 134 [2024-11-19 00:56:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:29,757 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 435 transitions. [2024-11-19 00:56:29,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 435 transitions. [2024-11-19 00:56:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:29,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:29,759 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:29,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:56:29,759 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:29,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1856306080, now seen corresponding path program 1 times [2024-11-19 00:56:29,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:29,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193271708] [2024-11-19 00:56:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:29,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193271708] [2024-11-19 00:56:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193271708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:30,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:56:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880557575] [2024-11-19 00:56:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:30,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:56:30,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:30,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:56:30,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:56:30,008 INFO L87 Difference]: Start difference. First operand 319 states and 435 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:30,159 INFO L93 Difference]: Finished difference Result 654 states and 886 transitions. [2024-11-19 00:56:30,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:56:30,159 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:30,162 INFO L225 Difference]: With dead ends: 654 [2024-11-19 00:56:30,162 INFO L226 Difference]: Without dead ends: 338 [2024-11-19 00:56:30,162 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-19 00:56:30,163 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 59 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:30,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 650 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-19 00:56:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 297. [2024-11-19 00:56:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 261 states have (on average 1.314176245210728) internal successors, (343), 262 states have internal predecessors, (343), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 403 transitions. [2024-11-19 00:56:30,194 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 403 transitions. Word has length 134 [2024-11-19 00:56:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:30,194 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 403 transitions. [2024-11-19 00:56:30,194 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 403 transitions. [2024-11-19 00:56:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:56:30,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:30,196 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:30,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:56:30,197 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:30,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1155241502, now seen corresponding path program 1 times [2024-11-19 00:56:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:30,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112216897] [2024-11-19 00:56:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:30,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:30,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:30,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112216897] [2024-11-19 00:56:30,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112216897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:30,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:30,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:30,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295018768] [2024-11-19 00:56:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:30,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:30,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:30,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:30,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:30,719 INFO L87 Difference]: Start difference. First operand 297 states and 403 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:31,050 INFO L93 Difference]: Finished difference Result 630 states and 851 transitions. [2024-11-19 00:56:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:56:31,051 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-19 00:56:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:31,053 INFO L225 Difference]: With dead ends: 630 [2024-11-19 00:56:31,053 INFO L226 Difference]: Without dead ends: 336 [2024-11-19 00:56:31,055 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-19 00:56:31,055 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 66 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:31,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1678 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-19 00:56:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 333. [2024-11-19 00:56:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 290 states have (on average 1.303448275862069) internal successors, (378), 292 states have internal predecessors, (378), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 00:56:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 448 transitions. [2024-11-19 00:56:31,092 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 448 transitions. Word has length 134 [2024-11-19 00:56:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:31,093 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 448 transitions. [2024-11-19 00:56:31,093 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 448 transitions. [2024-11-19 00:56:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:56:31,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:31,095 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:31,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:56:31,095 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:31,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:31,096 INFO L85 PathProgramCache]: Analyzing trace with hash 259226415, now seen corresponding path program 1 times [2024-11-19 00:56:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:31,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253316328] [2024-11-19 00:56:31,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253316328] [2024-11-19 00:56:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253316328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:31,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:31,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:56:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288721888] [2024-11-19 00:56:31,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:31,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:56:31,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:31,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:56:31,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:56:31,562 INFO L87 Difference]: Start difference. First operand 333 states and 448 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:31,883 INFO L93 Difference]: Finished difference Result 757 states and 1009 transitions. [2024-11-19 00:56:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:56:31,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-19 00:56:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:31,887 INFO L225 Difference]: With dead ends: 757 [2024-11-19 00:56:31,887 INFO L226 Difference]: Without dead ends: 427 [2024-11-19 00:56:31,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:56:31,889 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 252 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:31,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 740 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-19 00:56:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 345. [2024-11-19 00:56:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 302 states have (on average 1.304635761589404) internal successors, (394), 304 states have internal predecessors, (394), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 00:56:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 464 transitions. [2024-11-19 00:56:31,929 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 464 transitions. Word has length 135 [2024-11-19 00:56:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 464 transitions. [2024-11-19 00:56:31,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 464 transitions. [2024-11-19 00:56:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:31,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:31,932 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:31,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 00:56:31,932 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1008176994, now seen corresponding path program 1 times [2024-11-19 00:56:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:31,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750329795] [2024-11-19 00:56:31,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:31,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750329795] [2024-11-19 00:56:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750329795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:32,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:32,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:56:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505231398] [2024-11-19 00:56:32,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:56:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:56:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:32,737 INFO L87 Difference]: Start difference. First operand 345 states and 464 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:33,145 INFO L93 Difference]: Finished difference Result 372 states and 493 transitions. [2024-11-19 00:56:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:56:33,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-19 00:56:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:33,148 INFO L225 Difference]: With dead ends: 372 [2024-11-19 00:56:33,149 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 00:56:33,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:56:33,150 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 256 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:33,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1019 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:56:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 00:56:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 348. [2024-11-19 00:56:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 305 states have (on average 1.301639344262295) internal successors, (397), 307 states have internal predecessors, (397), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 00:56:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 467 transitions. [2024-11-19 00:56:33,189 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 467 transitions. Word has length 137 [2024-11-19 00:56:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:33,190 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 467 transitions. [2024-11-19 00:56:33,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 467 transitions. [2024-11-19 00:56:33,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:33,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:33,193 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:33,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:56:33,193 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:33,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1006329952, now seen corresponding path program 1 times [2024-11-19 00:56:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394878709] [2024-11-19 00:56:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:33,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:34,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394878709] [2024-11-19 00:56:34,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394878709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:34,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:56:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447971674] [2024-11-19 00:56:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:34,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:56:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:56:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:56:34,158 INFO L87 Difference]: Start difference. First operand 348 states and 467 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:34,617 INFO L93 Difference]: Finished difference Result 761 states and 1014 transitions. [2024-11-19 00:56:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:56:34,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-19 00:56:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:34,622 INFO L225 Difference]: With dead ends: 761 [2024-11-19 00:56:34,622 INFO L226 Difference]: Without dead ends: 416 [2024-11-19 00:56:34,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:56:34,623 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 299 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:34,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1107 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:56:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-19 00:56:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 386. [2024-11-19 00:56:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 343 states have (on average 1.3002915451895043) internal successors, (446), 345 states have internal predecessors, (446), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 00:56:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 516 transitions. [2024-11-19 00:56:34,662 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 516 transitions. Word has length 137 [2024-11-19 00:56:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:34,662 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 516 transitions. [2024-11-19 00:56:34,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 516 transitions. [2024-11-19 00:56:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:34,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:34,664 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:34,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:56:34,664 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:34,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1825075018, now seen corresponding path program 1 times [2024-11-19 00:56:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:34,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548706357] [2024-11-19 00:56:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548706357] [2024-11-19 00:56:35,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548706357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:35,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:35,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:35,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228499207] [2024-11-19 00:56:35,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:35,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:35,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:35,372 INFO L87 Difference]: Start difference. First operand 386 states and 516 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:36,200 INFO L93 Difference]: Finished difference Result 1084 states and 1450 transitions. [2024-11-19 00:56:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:56:36,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-19 00:56:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:36,204 INFO L225 Difference]: With dead ends: 1084 [2024-11-19 00:56:36,204 INFO L226 Difference]: Without dead ends: 699 [2024-11-19 00:56:36,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:56:36,206 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 680 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:36,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1254 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:56:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-19 00:56:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 393. [2024-11-19 00:56:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 350 states have (on average 1.3) internal successors, (455), 352 states have internal predecessors, (455), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 00:56:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 525 transitions. [2024-11-19 00:56:36,253 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 525 transitions. Word has length 137 [2024-11-19 00:56:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:36,253 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 525 transitions. [2024-11-19 00:56:36,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 525 transitions. [2024-11-19 00:56:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:36,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:36,256 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:36,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 00:56:36,256 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:36,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1007426568, now seen corresponding path program 1 times [2024-11-19 00:56:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:36,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520058788] [2024-11-19 00:56:36,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:37,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:37,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520058788] [2024-11-19 00:56:37,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520058788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:37,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 00:56:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368964931] [2024-11-19 00:56:37,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:37,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:56:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:37,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:56:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:56:37,297 INFO L87 Difference]: Start difference. First operand 393 states and 525 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:38,199 INFO L93 Difference]: Finished difference Result 926 states and 1233 transitions. [2024-11-19 00:56:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 00:56:38,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-19 00:56:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:38,203 INFO L225 Difference]: With dead ends: 926 [2024-11-19 00:56:38,203 INFO L226 Difference]: Without dead ends: 536 [2024-11-19 00:56:38,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2024-11-19 00:56:38,205 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 249 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:38,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 2659 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:56:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-19 00:56:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 377. [2024-11-19 00:56:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 334 states have (on average 1.2964071856287425) internal successors, (433), 336 states have internal predecessors, (433), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 00:56:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 503 transitions. [2024-11-19 00:56:38,248 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 503 transitions. Word has length 137 [2024-11-19 00:56:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:38,248 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 503 transitions. [2024-11-19 00:56:38,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 503 transitions. [2024-11-19 00:56:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:38,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:38,250 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:38,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 00:56:38,251 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:38,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:38,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1766199962, now seen corresponding path program 1 times [2024-11-19 00:56:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:38,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663623924] [2024-11-19 00:56:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:38,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:39,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:39,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663623924] [2024-11-19 00:56:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663623924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:39,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:56:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510542852] [2024-11-19 00:56:39,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:39,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:56:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:39,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:56:39,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:39,116 INFO L87 Difference]: Start difference. First operand 377 states and 503 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:39,381 INFO L93 Difference]: Finished difference Result 409 states and 538 transitions. [2024-11-19 00:56:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:56:39,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-19 00:56:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:39,385 INFO L225 Difference]: With dead ends: 409 [2024-11-19 00:56:39,385 INFO L226 Difference]: Without dead ends: 407 [2024-11-19 00:56:39,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:56:39,389 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 69 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:39,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1077 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-19 00:56:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 263. [2024-11-19 00:56:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 244 states have internal predecessors, (320), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 350 transitions. [2024-11-19 00:56:39,419 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 350 transitions. Word has length 137 [2024-11-19 00:56:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:39,419 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 350 transitions. [2024-11-19 00:56:39,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 350 transitions. [2024-11-19 00:56:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:39,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:39,421 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 00:56:39,421 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1768047004, now seen corresponding path program 1 times [2024-11-19 00:56:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889229490] [2024-11-19 00:56:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889229490] [2024-11-19 00:56:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889229490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:39,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:56:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060681550] [2024-11-19 00:56:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:56:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:39,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:56:39,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:39,952 INFO L87 Difference]: Start difference. First operand 263 states and 350 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:40,097 INFO L93 Difference]: Finished difference Result 649 states and 860 transitions. [2024-11-19 00:56:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:56:40,098 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-19 00:56:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:40,100 INFO L225 Difference]: With dead ends: 649 [2024-11-19 00:56:40,100 INFO L226 Difference]: Without dead ends: 389 [2024-11-19 00:56:40,101 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-19 00:56:40,102 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 53 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:40,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 743 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-19 00:56:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 352. [2024-11-19 00:56:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 333 states have (on average 1.3183183183183182) internal successors, (439), 333 states have internal predecessors, (439), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 469 transitions. [2024-11-19 00:56:40,130 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 469 transitions. Word has length 137 [2024-11-19 00:56:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:40,130 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 469 transitions. [2024-11-19 00:56:40,130 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 469 transitions. [2024-11-19 00:56:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:40,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:40,132 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:40,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 00:56:40,132 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:40,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1699501690, now seen corresponding path program 1 times [2024-11-19 00:56:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:40,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060628489] [2024-11-19 00:56:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:41,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:41,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060628489] [2024-11-19 00:56:41,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060628489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:41,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:41,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:56:41,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278582950] [2024-11-19 00:56:41,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:56:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:56:41,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:56:41,013 INFO L87 Difference]: Start difference. First operand 352 states and 469 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:41,698 INFO L93 Difference]: Finished difference Result 959 states and 1265 transitions. [2024-11-19 00:56:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 00:56:41,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-19 00:56:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:41,701 INFO L225 Difference]: With dead ends: 959 [2024-11-19 00:56:41,701 INFO L226 Difference]: Without dead ends: 610 [2024-11-19 00:56:41,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:56:41,703 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 267 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:41,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 2272 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:56:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-19 00:56:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 354. [2024-11-19 00:56:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 335 states have (on average 1.3164179104477611) internal successors, (441), 335 states have internal predecessors, (441), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 471 transitions. [2024-11-19 00:56:41,736 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 471 transitions. Word has length 137 [2024-11-19 00:56:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:41,736 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 471 transitions. [2024-11-19 00:56:41,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 471 transitions. [2024-11-19 00:56:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:41,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:41,738 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:41,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 00:56:41,738 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1777817156, now seen corresponding path program 1 times [2024-11-19 00:56:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909164358] [2024-11-19 00:56:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909164358] [2024-11-19 00:56:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909164358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:42,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:42,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:42,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990439994] [2024-11-19 00:56:42,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:42,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:42,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:42,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:42,481 INFO L87 Difference]: Start difference. First operand 354 states and 471 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:43,323 INFO L93 Difference]: Finished difference Result 1018 states and 1346 transitions. [2024-11-19 00:56:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:56:43,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-19 00:56:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:43,327 INFO L225 Difference]: With dead ends: 1018 [2024-11-19 00:56:43,327 INFO L226 Difference]: Without dead ends: 667 [2024-11-19 00:56:43,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:56:43,329 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 467 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:43,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1352 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:56:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-19 00:56:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 374. [2024-11-19 00:56:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 355 states have (on average 1.315492957746479) internal successors, (467), 355 states have internal predecessors, (467), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 497 transitions. [2024-11-19 00:56:43,367 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 497 transitions. Word has length 137 [2024-11-19 00:56:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:43,367 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 497 transitions. [2024-11-19 00:56:43,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 497 transitions. [2024-11-19 00:56:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:43,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:43,369 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 00:56:43,369 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash 497953478, now seen corresponding path program 1 times [2024-11-19 00:56:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786437436] [2024-11-19 00:56:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:43,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:43,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786437436] [2024-11-19 00:56:43,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786437436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:43,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:43,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:56:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580859273] [2024-11-19 00:56:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:43,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:56:43,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:43,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:56:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:56:43,867 INFO L87 Difference]: Start difference. First operand 374 states and 497 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:44,169 INFO L93 Difference]: Finished difference Result 952 states and 1245 transitions. [2024-11-19 00:56:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:56:44,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2024-11-19 00:56:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:44,172 INFO L225 Difference]: With dead ends: 952 [2024-11-19 00:56:44,172 INFO L226 Difference]: Without dead ends: 581 [2024-11-19 00:56:44,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:56:44,173 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 138 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:44,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1979 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:56:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-19 00:56:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 366. [2024-11-19 00:56:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 347 states have (on average 1.3112391930835734) internal successors, (455), 347 states have internal predecessors, (455), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 485 transitions. [2024-11-19 00:56:44,205 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 485 transitions. Word has length 137 [2024-11-19 00:56:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:44,206 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 485 transitions. [2024-11-19 00:56:44,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 485 transitions. [2024-11-19 00:56:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:44,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:44,207 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:44,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 00:56:44,208 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:44,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash -904939233, now seen corresponding path program 1 times [2024-11-19 00:56:44,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912116984] [2024-11-19 00:56:44,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912116984] [2024-11-19 00:56:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912116984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:56:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964624020] [2024-11-19 00:56:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:44,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:56:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:56:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:56:44,925 INFO L87 Difference]: Start difference. First operand 366 states and 485 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:45,758 INFO L93 Difference]: Finished difference Result 830 states and 1094 transitions. [2024-11-19 00:56:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:56:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-19 00:56:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:45,762 INFO L225 Difference]: With dead ends: 830 [2024-11-19 00:56:45,762 INFO L226 Difference]: Without dead ends: 467 [2024-11-19 00:56:45,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:56:45,763 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 359 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:45,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1039 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:56:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-19 00:56:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 344. [2024-11-19 00:56:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 325 states have (on average 1.2953846153846154) internal successors, (421), 325 states have internal predecessors, (421), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 451 transitions. [2024-11-19 00:56:45,799 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 451 transitions. Word has length 137 [2024-11-19 00:56:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:45,799 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 451 transitions. [2024-11-19 00:56:45,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 451 transitions. [2024-11-19 00:56:45,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 00:56:45,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:45,800 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:45,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 00:56:45,800 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:45,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:45,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1414412323, now seen corresponding path program 1 times [2024-11-19 00:56:45,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:45,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411123593] [2024-11-19 00:56:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:46,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411123593] [2024-11-19 00:56:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411123593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:46,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:46,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:56:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300060838] [2024-11-19 00:56:46,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:46,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:56:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:56:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:56:46,403 INFO L87 Difference]: Start difference. First operand 344 states and 451 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:46,898 INFO L93 Difference]: Finished difference Result 780 states and 1018 transitions. [2024-11-19 00:56:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:56:46,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2024-11-19 00:56:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:46,901 INFO L225 Difference]: With dead ends: 780 [2024-11-19 00:56:46,901 INFO L226 Difference]: Without dead ends: 439 [2024-11-19 00:56:46,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:56:46,902 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 348 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:46,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 986 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:56:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-19 00:56:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 316. [2024-11-19 00:56:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 297 states have internal predecessors, (379), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 409 transitions. [2024-11-19 00:56:46,939 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 409 transitions. Word has length 137 [2024-11-19 00:56:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:46,940 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 409 transitions. [2024-11-19 00:56:46,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 409 transitions. [2024-11-19 00:56:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:56:46,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:46,941 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:46,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 00:56:46,942 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:46,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1050783877, now seen corresponding path program 1 times [2024-11-19 00:56:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:46,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392625685] [2024-11-19 00:56:46,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:46,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:47,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:47,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392625685] [2024-11-19 00:56:47,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392625685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:47,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:47,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:56:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005215545] [2024-11-19 00:56:47,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:56:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:47,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:56:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:47,301 INFO L87 Difference]: Start difference. First operand 316 states and 409 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:47,493 INFO L93 Difference]: Finished difference Result 670 states and 864 transitions. [2024-11-19 00:56:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:56:47,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-19 00:56:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:47,495 INFO L225 Difference]: With dead ends: 670 [2024-11-19 00:56:47,495 INFO L226 Difference]: Without dead ends: 357 [2024-11-19 00:56:47,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:47,496 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 61 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:47,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 677 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-19 00:56:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 316. [2024-11-19 00:56:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 297 states have (on average 1.2727272727272727) internal successors, (378), 297 states have internal predecessors, (378), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:56:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 408 transitions. [2024-11-19 00:56:47,538 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 408 transitions. Word has length 139 [2024-11-19 00:56:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:47,538 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 408 transitions. [2024-11-19 00:56:47,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 408 transitions. [2024-11-19 00:56:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:56:47,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:47,542 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:47,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 00:56:47,543 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:47,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1191332487, now seen corresponding path program 1 times [2024-11-19 00:56:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:47,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418467334] [2024-11-19 00:56:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:56:47,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249529539] [2024-11-19 00:56:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:47,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:47,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:47,636 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-19 00:56:47,637 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-19 00:56:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:48,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-19 00:56:48,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:56:48,645 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 25 treesize of output 5 [2024-11-19 00:56:49,355 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-19 00:56:50,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:56:50,188 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 11 [2024-11-19 00:56:50,209 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-19 00:56:50,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-19 00:56:50,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 70 treesize of output 50 [2024-11-19 00:56:50,396 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 23 treesize of output 15 [2024-11-19 00:56:50,523 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 43 treesize of output 23 [2024-11-19 00:56:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 257 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-19 00:56:50,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:56:51,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:51,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418467334] [2024-11-19 00:56:51,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:56:51,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249529539] [2024-11-19 00:56:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249529539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:56:51,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:56:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-19 00:56:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145925523] [2024-11-19 00:56:51,801 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 00:56:51,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 00:56:51,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:51,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 00:56:51,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:56:51,803 INFO L87 Difference]: Start difference. First operand 316 states and 408 transitions. Second operand has 17 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:53,268 INFO L93 Difference]: Finished difference Result 1021 states and 1303 transitions. [2024-11-19 00:56:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 00:56:53,268 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 139 [2024-11-19 00:56:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:53,271 INFO L225 Difference]: With dead ends: 1021 [2024-11-19 00:56:53,272 INFO L226 Difference]: Without dead ends: 680 [2024-11-19 00:56:53,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 00:56:53,273 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 228 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:53,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1387 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:56:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-19 00:56:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 441. [2024-11-19 00:56:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 404 states have (on average 1.2673267326732673) internal successors, (512), 404 states have internal predecessors, (512), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 572 transitions. [2024-11-19 00:56:53,344 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 572 transitions. Word has length 139 [2024-11-19 00:56:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:53,345 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 572 transitions. [2024-11-19 00:56:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 00:56:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 572 transitions. [2024-11-19 00:56:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:56:53,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:53,346 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:53,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:56:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:53,547 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:53,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1938585677, now seen corresponding path program 1 times [2024-11-19 00:56:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299265359] [2024-11-19 00:56:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:56:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:56:53,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:56:53,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299265359] [2024-11-19 00:56:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299265359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:56:53,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:56:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:56:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84278939] [2024-11-19 00:56:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:56:53,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:56:53,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:56:53,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:56:53,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:56:53,998 INFO L87 Difference]: Start difference. First operand 441 states and 572 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:56:54,228 INFO L93 Difference]: Finished difference Result 795 states and 1026 transitions. [2024-11-19 00:56:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:56:54,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-19 00:56:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:56:54,232 INFO L225 Difference]: With dead ends: 795 [2024-11-19 00:56:54,232 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 00:56:54,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:56:54,234 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 62 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:56:54,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 700 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:56:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 00:56:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 441. [2024-11-19 00:56:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 404 states have (on average 1.2648514851485149) internal successors, (511), 404 states have internal predecessors, (511), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:56:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 571 transitions. [2024-11-19 00:56:54,334 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 571 transitions. Word has length 139 [2024-11-19 00:56:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:56:54,335 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 571 transitions. [2024-11-19 00:56:54,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:56:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 571 transitions. [2024-11-19 00:56:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:56:54,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:56:54,337 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:54,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 00:56:54,337 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:56:54,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:56:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1798037067, now seen corresponding path program 1 times [2024-11-19 00:56:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:56:54,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391514087] [2024-11-19 00:56:54,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:56:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:56:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461366138] [2024-11-19 00:56:54,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:56:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:56:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:56:54,464 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-19 00:56:54,466 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-19 00:56:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:56:55,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:56:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:56:55,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:56:55,459 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:56:55,460 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:56:55,487 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-19 00:56:55,663 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,SelfDestructingSolverStorable34 [2024-11-19 00:56:55,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:56:55,845 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:56:55,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:56:55 BoogieIcfgContainer [2024-11-19 00:56:55,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:56:55,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:56:55,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:56:55,851 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:56:55,851 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:56:11" (3/4) ... [2024-11-19 00:56:55,853 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:56:55,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:56:55,855 INFO L158 Benchmark]: Toolchain (without parser) took 45537.09ms. Allocated memory was 146.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 91.7MB in the beginning and 855.1MB in the end (delta: -763.3MB). Peak memory consumption was 297.2MB. Max. memory is 16.1GB. [2024-11-19 00:56:55,855 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:56:55,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.09ms. Allocated memory is still 146.8MB. Free memory was 91.3MB in the beginning and 75.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:56:55,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.76ms. Allocated memory is still 146.8MB. Free memory was 75.0MB in the beginning and 71.2MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:56:55,858 INFO L158 Benchmark]: Boogie Preprocessor took 157.94ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 71.2MB in the beginning and 157.2MB in the end (delta: -85.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-19 00:56:55,859 INFO L158 Benchmark]: RCFGBuilder took 901.23ms. Allocated memory is still 190.8MB. Free memory was 157.2MB in the beginning and 109.8MB in the end (delta: 47.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-19 00:56:55,860 INFO L158 Benchmark]: TraceAbstraction took 44023.30ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 108.9MB in the beginning and 855.1MB in the end (delta: -746.1MB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. [2024-11-19 00:56:55,860 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 1.2GB. Free memory is still 855.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:56:55,860 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.09ms. Allocated memory is still 146.8MB. Free memory was 91.3MB in the beginning and 75.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.76ms. Allocated memory is still 146.8MB. Free memory was 75.0MB in the beginning and 71.2MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 157.94ms. Allocated memory was 146.8MB in the beginning and 190.8MB in the end (delta: 44.0MB). Free memory was 71.2MB in the beginning and 157.2MB in the end (delta: -85.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * RCFGBuilder took 901.23ms. Allocated memory is still 190.8MB. Free memory was 157.2MB in the beginning and 109.8MB in the end (delta: 47.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 44023.30ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 108.9MB in the beginning and 855.1MB in the end (delta: -746.1MB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 1.2GB. Free memory is still 855.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 someBinaryFLOATComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 5; [L22] unsigned short int var_1_1 = 5; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_3 = -25; [L24] signed short int var_1_3 = -25; [L25] signed short int* var_1_3_Pointer = &(var_1_3); [L26] unsigned short int var_1_7 = 4; [L26] unsigned short int var_1_7 = 4; [L27] unsigned short int* var_1_7_Pointer = &(var_1_7); [L28] unsigned char var_1_8 = 4; [L28] unsigned char var_1_8 = 4; [L29] unsigned char* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_10 = 4; [L30] unsigned char var_1_10 = 4; [L31] unsigned char* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_11 = 8; [L32] unsigned char var_1_11 = 8; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] unsigned long int var_1_12 = 10; [L34] unsigned long int var_1_12 = 10; [L35] unsigned long int* var_1_12_Pointer = &(var_1_12); [L36] float var_1_13 = 99.6; [L36] float var_1_13 = 99.6; [L37] float* var_1_13_Pointer = &(var_1_13); [L38] float var_1_14 = 127.5; [L38] float var_1_14 = 127.5; [L39] float* var_1_14_Pointer = &(var_1_14); [L40] float var_1_15 = 16.5; [L40] float var_1_15 = 16.5; [L41] float* var_1_15_Pointer = &(var_1_15); [L42] float var_1_16 = 256.5; [L42] float var_1_16 = 256.5; [L43] float* var_1_16_Pointer = &(var_1_16); [L44] unsigned long int var_1_17 = 4288034294; [L44] unsigned long int var_1_17 = 4288034294; [L45] unsigned long int* var_1_17_Pointer = &(var_1_17); [L46] unsigned char var_1_18 = 0; [L46] unsigned char var_1_18 = 0; [L47] unsigned char* var_1_18_Pointer = &(var_1_18); [L48] unsigned long int last_1_var_1_12 = 10; [L49] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR \read(var_1_12) [L100] last_1_var_1_12 = var_1_12 [L101] EXPR \read(var_1_18) [L101] last_1_var_1_18 = var_1_18 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L75] var_1_3 = __VERIFIER_nondet_short() [L76] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L76] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L76] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L80] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L80] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L82] var_1_11 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L83] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L83] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L85] var_1_13 = __VERIFIER_nondet_float() [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L87] var_1_14 = __VERIFIER_nondet_float() [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L89] var_1_15 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] EXPR \read(var_1_16) [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F [L93] EXPR \read(var_1_16) [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR (var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR (var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L95] var_1_17 = __VERIFIER_nondet_ulong() [L96] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L96] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L96] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR \read(*var_1_3_Pointer) [L53] unsigned long int stepLocal_2 = last_1_var_1_12 / (*(var_1_3_Pointer)); [L54] COND TRUE stepLocal_2 != (last_1_var_1_18 - 64) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L55] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L55] (*(var_1_8_Pointer)) = (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))) [L59] EXPR \read(*var_1_13_Pointer) [L59] EXPR \read(*var_1_14_Pointer) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L59] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) [L59] EXPR \read(*var_1_16_Pointer) [L59] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L59] COND TRUE (- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer)))))) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L60] EXPR (((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer))) [L60] EXPR \read(*var_1_8_Pointer) [L60] EXPR (((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L60] (*(var_1_12_Pointer)) = (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))) [L64] EXPR \read(*var_1_11_Pointer) [L64] (*(var_1_18_Pointer)) = (*(var_1_11_Pointer)) [L65] EXPR \read(*var_1_18_Pointer) [L65] (*(var_1_7_Pointer)) = (*(var_1_18_Pointer)) [L66] EXPR \read(*var_1_3_Pointer) [L66] signed long int stepLocal_1 = - (*(var_1_3_Pointer)); [L67] EXPR \read(*var_1_7_Pointer) [L67] EXPR \read(*var_1_3_Pointer) [L67] signed long int stepLocal_0 = (*(var_1_7_Pointer)) / (*(var_1_3_Pointer)); [L68] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L68] COND FALSE !(stepLocal_0 >= (*(var_1_7_Pointer))) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_3_Pointer) [L104] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1 [L104] EXPR (((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_18_Pointer) [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) [L104] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) [L104] EXPR \read(*var_1_8_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) [L104] EXPR \read(*var_1_13_Pointer) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_12_Pointer) [L104] EXPR \read(*var_1_17_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104-L105] return (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.8s, OverallIterations: 35, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6481 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6481 mSDsluCounter, 34113 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27900 mSDsCounter, 879 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8201 IncrementalHoareTripleChecker+Invalid, 9080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 879 mSolverCounterUnsat, 6213 mSDtfsCounter, 8201 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1057 GetRequests, 663 SyntacticMatches, 1 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=33, InterpolantAutomatonStates: 308, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 2517 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 5388 NumberOfCodeBlocks, 5388 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4934 ConstructedInterpolants, 116 QuantifiedInterpolants, 21912 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2326 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 37 InterpolantComputations, 33 PerfectInterpolantSequences, 15189/15540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:56:55,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.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 e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:56:58,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:56:58,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:56:58,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:56:58,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:56:58,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:56:58,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:56:58,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:56:58,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:56:58,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:56:58,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:56:58,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:56:58,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:56:58,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:56:58,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:56:58,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:56:58,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:56:58,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:56:58,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:56:58,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:56:58,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:56:58,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:56:58,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:56:58,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:56:58,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:56:58,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:56:58,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:56:58,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:56:58,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:56:58,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:56:58,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:56:58,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:56:58,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:56:58,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:56:58,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:56:58,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:56:58,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:56:58,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:56:58,307 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:56:58,307 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:56:58,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:56:58,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:56:58,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:56:58,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:56:58,309 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 -> e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 [2024-11-19 00:56:58,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:56:58,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:56:58,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:56:58,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:56:58,665 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:56:58,666 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-4.i [2024-11-19 00:57:00,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:57:00,456 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:57:00,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2024-11-19 00:57:00,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11a47128/eb41a317ee7249b8a1a99a653fbaec96/FLAGc5a95ae39 [2024-11-19 00:57:00,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11a47128/eb41a317ee7249b8a1a99a653fbaec96 [2024-11-19 00:57:00,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:57:00,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:57:00,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:57:00,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:57:00,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:57:00,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:00,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277ed1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00, skipping insertion in model container [2024-11-19 00:57:00,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:00,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:57:00,707 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-4.i[915,928] [2024-11-19 00:57:00,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:57:00,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:57:00,808 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-4.i[915,928] [2024-11-19 00:57:00,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:57:00,881 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:57:00,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00 WrapperNode [2024-11-19 00:57:00,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:57:00,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:57:00,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:57:00,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:57:00,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:00,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:00,957 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-19 00:57:00,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:57:00,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:57:00,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:57:00,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:57:00,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:00,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:00,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:01,031 INFO L175 MemorySlicer]: Split 130 memory accesses to 14 slices as follows [2, 3, 11, 9, 13, 18, 14, 6, 8, 8, 11, 11, 6, 10]. 14 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2024-11-19 00:57:01,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:01,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:01,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:01,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:01,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:01,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:01,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:57:01,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:57:01,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:57:01,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:57:01,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (1/1) ... [2024-11-19 00:57:01,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:57:01,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:57:01,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:57:01,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:57:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:57:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:57:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:57:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:57:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:57:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:57:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:57:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:57:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 00:57:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 00:57:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 00:57:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 00:57:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 00:57:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 00:57:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-19 00:57:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:57:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:57:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:57:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:57:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:57:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:57:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 00:57:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-19 00:57:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-19 00:57:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-19 00:57:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-19 00:57:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-19 00:57:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-19 00:57:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-19 00:57:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:57:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:57:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:57:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:57:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:57:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:57:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:57:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 00:57:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 00:57:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 00:57:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 00:57:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 00:57:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 00:57:01,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-19 00:57:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:57:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:57:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:57:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:57:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:57:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:57:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 00:57:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 00:57:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 00:57:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 00:57:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-19 00:57:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-19 00:57:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-19 00:57:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-19 00:57:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:57:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:57:01,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:57:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:57:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:57:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:57:01,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-19 00:57:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-19 00:57:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-19 00:57:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-19 00:57:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-19 00:57:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-19 00:57:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-19 00:57:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-11-19 00:57:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:57:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:57:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:57:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:57:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:57:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:57:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 00:57:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-19 00:57:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-19 00:57:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-19 00:57:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-19 00:57:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-19 00:57:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-19 00:57:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-19 00:57:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:57:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:57:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:57:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:57:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:57:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:57:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 00:57:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-19 00:57:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-19 00:57:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-19 00:57:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:57:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:57:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-19 00:57:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-19 00:57:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-19 00:57:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-19 00:57:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-19 00:57:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-19 00:57:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-19 00:57:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-11-19 00:57:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:57:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:57:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:57:01,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:57:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:57:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:57:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-19 00:57:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-19 00:57:01,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-19 00:57:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-19 00:57:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-19 00:57:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-19 00:57:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-19 00:57:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-11-19 00:57:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:57:01,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:57:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:57:01,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 00:57:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 00:57:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-19 00:57:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:57:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:57:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:57:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:57:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:57:01,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-19 00:57:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-19 00:57:01,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-19 00:57:01,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-19 00:57:01,570 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:57:01,573 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:57:13,403 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-19 00:57:13,404 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:57:13,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:57:13,420 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:57:13,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:57:13 BoogieIcfgContainer [2024-11-19 00:57:13,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:57:13,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:57:13,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:57:13,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:57:13,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:57:00" (1/3) ... [2024-11-19 00:57:13,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a42f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:57:13, skipping insertion in model container [2024-11-19 00:57:13,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:57:00" (2/3) ... [2024-11-19 00:57:13,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a42f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:57:13, skipping insertion in model container [2024-11-19 00:57:13,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:57:13" (3/3) ... [2024-11-19 00:57:13,428 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-4.i [2024-11-19 00:57:13,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:57:13,447 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:57:13,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:57:13,538 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;@2b1f27ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:57:13,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:57:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:57:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 00:57:13,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:57:13,559 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:57:13,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:57:13,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:57:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1790010152, now seen corresponding path program 1 times [2024-11-19 00:57:13,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:57:13,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168072234] [2024-11-19 00:57:13,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:57:13,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:57:13,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:57:13,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:57:13,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:57:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:57:14,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:57:14,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:57:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-19 00:57:14,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:57:14,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:57:14,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168072234] [2024-11-19 00:57:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168072234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:57:14,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:57:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:57:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887526834] [2024-11-19 00:57:14,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:57:14,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:57:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF