./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.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-13.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 cdcd3642c2c30159222eee25927f49b3d8b3f6c368c10235d87e2600cd134b94 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:53:07,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:53:07,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:53:07,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:53:07,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:53:07,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:53:07,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:53:07,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:53:07,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:53:07,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:53:07,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:53:07,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:53:07,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:53:07,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:53:07,729 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:53:07,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:53:07,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:53:07,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:53:07,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:53:07,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:53:07,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:53:07,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:53:07,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:53:07,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:53:07,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:53:07,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:53:07,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:53:07,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:53:07,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:53:07,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:53:07,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:53:07,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:53:07,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:53:07,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:53:07,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:53:07,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:53:07,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:53:07,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:53:07,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:53:07,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:53:07,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:53:07,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:53:07,739 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 -> cdcd3642c2c30159222eee25927f49b3d8b3f6c368c10235d87e2600cd134b94 [2024-11-19 00:53:08,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:53:08,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:53:08,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:53:08,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:53:08,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:53:08,044 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-13.i [2024-11-19 00:53:09,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:53:09,663 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:53:09,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.i [2024-11-19 00:53:09,678 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ff386b8/acb00c4915974fe79cb1c266e6c19d79/FLAGb15bc7e29 [2024-11-19 00:53:10,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ff386b8/acb00c4915974fe79cb1c266e6c19d79 [2024-11-19 00:53:10,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:53:10,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:53:10,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:53:10,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:53:10,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:53:10,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf764d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10, skipping insertion in model container [2024-11-19 00:53:10,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:53:10,269 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-13.i[916,929] [2024-11-19 00:53:10,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:53:10,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:53:10,348 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-13.i[916,929] [2024-11-19 00:53:10,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:53:10,400 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:53:10,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10 WrapperNode [2024-11-19 00:53:10,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:53:10,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:53:10,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:53:10,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:53:10,409 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:53:10" (1/1) ... [2024-11-19 00:53:10,424 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:53:10" (1/1) ... [2024-11-19 00:53:10,460 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2024-11-19 00:53:10,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:53:10,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:53:10,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:53:10,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:53:10,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,504 INFO L175 MemorySlicer]: Split 115 memory accesses to 14 slices as follows [2, 5, 8, 5, 7, 6, 5, 10, 10, 23, 8, 8, 8, 10]. 20 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, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-11-19 00:53:10,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:53:10,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:53:10,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:53:10,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:53:10,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (1/1) ... [2024-11-19 00:53:10,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:53:10,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:53:10,584 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:53:10,592 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:53:10,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:53:10,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:53:10,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:53:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:53:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:53:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:53:10,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:53:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 00:53:10,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 00:53:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 00:53:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 00:53:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 00:53:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 00:53:10,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 00:53:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-19 00:53:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:53:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:53:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:53:10,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:53:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:53:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:53:10,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-19 00:53:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-19 00:53:10,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-19 00:53:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-19 00:53:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-19 00:53:10,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-19 00:53:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-19 00:53:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-19 00:53:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:53:10,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:53:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:53:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:53:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:53:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:53:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-19 00:53:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-19 00:53:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:53:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-19 00:53:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:53:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:53:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:53:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:53:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:53:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:53:10,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-19 00:53:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-19 00:53:10,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-19 00:53:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-19 00:53:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-19 00:53:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-19 00:53:10,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-19 00:53:10,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-19 00:53:10,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:53:10,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:53:10,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:53:10,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:53:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:53:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:53:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:53:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:53:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 00:53:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 00:53:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 00:53:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 00:53:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 00:53:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 00:53:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 00:53:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 00:53:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:53:10,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:53:10,869 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:53:10,870 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:53:11,370 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-19 00:53:11,370 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:53:11,385 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:53:11,385 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:53:11,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:53:11 BoogieIcfgContainer [2024-11-19 00:53:11,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:53:11,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:53:11,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:53:11,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:53:11,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:53:10" (1/3) ... [2024-11-19 00:53:11,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cbd0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:53:11, skipping insertion in model container [2024-11-19 00:53:11,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:10" (2/3) ... [2024-11-19 00:53:11,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cbd0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:53:11, skipping insertion in model container [2024-11-19 00:53:11,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:53:11" (3/3) ... [2024-11-19 00:53:11,398 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-13.i [2024-11-19 00:53:11,414 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:53:11,414 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:53:11,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:53:11,515 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;@7b16be0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:53:11,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:53:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 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:53:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:53:11,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:11,531 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] [2024-11-19 00:53:11,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:11,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:11,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1910210082, now seen corresponding path program 1 times [2024-11-19 00:53:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554240948] [2024-11-19 00:53:11,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:11,931 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:53:11,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554240948] [2024-11-19 00:53:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554240948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:53:11,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210612795] [2024-11-19 00:53:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:11,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:53:11,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:53:11,935 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:53:11,936 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:53:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:12,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:53:12,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:12,268 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:53:12,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:53:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210612795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:53:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:53:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369460272] [2024-11-19 00:53:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:53:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:12,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:53:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:53:12,310 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 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.5) internal successors, (61), 2 states have internal predecessors, (61), 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:53:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:12,350 INFO L93 Difference]: Finished difference Result 217 states and 341 transitions. [2024-11-19 00:53:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:53:12,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 131 [2024-11-19 00:53:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:12,361 INFO L225 Difference]: With dead ends: 217 [2024-11-19 00:53:12,361 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 00:53:12,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:53:12,370 INFO L432 NwaCegarLoop]: 159 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, 159 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:53:12,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 00:53:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 00:53:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:53:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2024-11-19 00:53:12,428 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2024-11-19 00:53:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:12,429 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2024-11-19 00:53:12,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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:53:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2024-11-19 00:53:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:53:12,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:12,434 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] [2024-11-19 00:53:12,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:53:12,635 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:53:12,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:12,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 660310348, now seen corresponding path program 1 times [2024-11-19 00:53:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217331665] [2024-11-19 00:53:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 00:53:13,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:13,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217331665] [2024-11-19 00:53:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217331665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:53:13,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569377471] [2024-11-19 00:53:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:13,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:53:13,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:53:13,176 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:53:13,178 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:53:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:13,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:53:13,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:13,531 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:53:13,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:53:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569377471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:13,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:53:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 00:53:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423638381] [2024-11-19 00:53:13,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:13,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:53:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:13,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:53:13,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:53:13,538 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:53:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:13,591 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2024-11-19 00:53:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:53:13,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 131 [2024-11-19 00:53:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:13,594 INFO L225 Difference]: With dead ends: 215 [2024-11-19 00:53:13,594 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 00:53:13,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 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:53:13,598 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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:53:13,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 00:53:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 00:53:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) 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:53:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-11-19 00:53:13,619 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2024-11-19 00:53:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:13,620 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-11-19 00:53:13,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:53:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2024-11-19 00:53:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:53:13,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:13,623 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] [2024-11-19 00:53:13,637 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:53:13,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 00:53:13,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:13,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1766606521, now seen corresponding path program 1 times [2024-11-19 00:53:13,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:13,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140983824] [2024-11-19 00:53:13,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:14,242 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:53:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140983824] [2024-11-19 00:53:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140983824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:14,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:53:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027854399] [2024-11-19 00:53:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:14,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:53:14,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:53:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:53:14,249 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:53:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:14,320 INFO L93 Difference]: Finished difference Result 324 states and 477 transitions. [2024-11-19 00:53:14,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:53:14,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 133 [2024-11-19 00:53:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:14,326 INFO L225 Difference]: With dead ends: 324 [2024-11-19 00:53:14,326 INFO L226 Difference]: Without dead ends: 217 [2024-11-19 00:53:14,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:14,330 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 105 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:14,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 455 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-19 00:53:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2024-11-19 00:53:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 180 states have (on average 1.4111111111111112) internal successors, (254), 180 states have internal predecessors, (254), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:53:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 314 transitions. [2024-11-19 00:53:14,352 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 314 transitions. Word has length 133 [2024-11-19 00:53:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:14,353 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 314 transitions. [2024-11-19 00:53:14,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:53:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 314 transitions. [2024-11-19 00:53:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:53:14,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:14,356 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] [2024-11-19 00:53:14,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:53:14,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:14,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1710712325, now seen corresponding path program 1 times [2024-11-19 00:53:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:14,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469172934] [2024-11-19 00:53:14,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:14,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:14,777 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:53:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:14,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469172934] [2024-11-19 00:53:14,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469172934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:14,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:14,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:53:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164910280] [2024-11-19 00:53:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:14,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:53:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:14,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:53:14,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:14,784 INFO L87 Difference]: Start difference. First operand 213 states and 314 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:53:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:14,853 INFO L93 Difference]: Finished difference Result 463 states and 682 transitions. [2024-11-19 00:53:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:53:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 133 [2024-11-19 00:53:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:14,856 INFO L225 Difference]: With dead ends: 463 [2024-11-19 00:53:14,858 INFO L226 Difference]: Without dead ends: 253 [2024-11-19 00:53:14,859 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:53:14,860 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 52 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:14,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 607 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-19 00:53:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 222. [2024-11-19 00:53:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 189 states have internal predecessors, (267), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:53:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 327 transitions. [2024-11-19 00:53:14,878 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 327 transitions. Word has length 133 [2024-11-19 00:53:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:14,879 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 327 transitions. [2024-11-19 00:53:14,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:53:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 327 transitions. [2024-11-19 00:53:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:14,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:14,881 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:53:14,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:53:14,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash 173559527, now seen corresponding path program 1 times [2024-11-19 00:53:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581212226] [2024-11-19 00:53:14,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:15,262 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:53:15,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581212226] [2024-11-19 00:53:15,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581212226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:15,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:15,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:53:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41209701] [2024-11-19 00:53:15,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:15,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:53:15,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:15,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:53:15,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:53:15,265 INFO L87 Difference]: Start difference. First operand 222 states and 327 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:53:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:15,366 INFO L93 Difference]: Finished difference Result 565 states and 826 transitions. [2024-11-19 00:53:15,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:53:15,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:53:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:15,371 INFO L225 Difference]: With dead ends: 565 [2024-11-19 00:53:15,371 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 00:53:15,372 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:53:15,373 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 71 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:15,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 829 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:53:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 00:53:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2024-11-19 00:53:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 297 states have (on average 1.404040404040404) internal successors, (417), 299 states have internal predecessors, (417), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:53:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 497 transitions. [2024-11-19 00:53:15,412 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 497 transitions. Word has length 134 [2024-11-19 00:53:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:15,413 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 497 transitions. [2024-11-19 00:53:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:53:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 497 transitions. [2024-11-19 00:53:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:15,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:15,416 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:53:15,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:53:15,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:15,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash -219467483, now seen corresponding path program 1 times [2024-11-19 00:53:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895078101] [2024-11-19 00:53:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:15,522 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:53:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:15,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895078101] [2024-11-19 00:53:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895078101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:15,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:53:15,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454965699] [2024-11-19 00:53:15,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:15,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:53:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:15,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:53:15,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:53:15,528 INFO L87 Difference]: Start difference. First operand 342 states and 497 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (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:53:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:15,575 INFO L93 Difference]: Finished difference Result 685 states and 999 transitions. [2024-11-19 00:53:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:53:15,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (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:53:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:15,581 INFO L225 Difference]: With dead ends: 685 [2024-11-19 00:53:15,581 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 00:53:15,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:53:15,583 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:15,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 00:53:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-19 00:53:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 301 states have (on average 1.398671096345515) internal successors, (421), 303 states have internal predecessors, (421), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:53:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 501 transitions. [2024-11-19 00:53:15,606 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 501 transitions. Word has length 134 [2024-11-19 00:53:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 501 transitions. [2024-11-19 00:53:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (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:53:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 501 transitions. [2024-11-19 00:53:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:15,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:15,610 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:53:15,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:53:15,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:15,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:15,614 INFO L85 PathProgramCache]: Analyzing trace with hash 481597095, now seen corresponding path program 1 times [2024-11-19 00:53:15,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:15,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448593245] [2024-11-19 00:53:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:15,953 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:53:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448593245] [2024-11-19 00:53:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448593245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:15,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:15,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:53:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136253464] [2024-11-19 00:53:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:15,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:53:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:15,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:53:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:15,955 INFO L87 Difference]: Start difference. First operand 346 states and 501 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:53:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:16,037 INFO L93 Difference]: Finished difference Result 752 states and 1085 transitions. [2024-11-19 00:53:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:53:16,038 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:53:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:16,040 INFO L225 Difference]: With dead ends: 752 [2024-11-19 00:53:16,042 INFO L226 Difference]: Without dead ends: 409 [2024-11-19 00:53:16,043 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:53:16,044 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 55 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:16,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 606 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-19 00:53:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 346. [2024-11-19 00:53:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 301 states have (on average 1.3853820598006645) internal successors, (417), 303 states have internal predecessors, (417), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:53:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 497 transitions. [2024-11-19 00:53:16,068 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 497 transitions. Word has length 134 [2024-11-19 00:53:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:16,070 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 497 transitions. [2024-11-19 00:53:16,071 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:53:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 497 transitions. [2024-11-19 00:53:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:16,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:16,073 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:53:16,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:53:16,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:16,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1512547611, now seen corresponding path program 1 times [2024-11-19 00:53:16,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:16,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821964937] [2024-11-19 00:53:16,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:16,806 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:53:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821964937] [2024-11-19 00:53:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821964937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:16,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:16,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:53:16,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327144823] [2024-11-19 00:53:16,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:16,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:53:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:16,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:53:16,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:16,809 INFO L87 Difference]: Start difference. First operand 346 states and 497 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:53:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:17,021 INFO L93 Difference]: Finished difference Result 756 states and 1082 transitions. [2024-11-19 00:53:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:53:17,022 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:53:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:17,025 INFO L225 Difference]: With dead ends: 756 [2024-11-19 00:53:17,026 INFO L226 Difference]: Without dead ends: 413 [2024-11-19 00:53:17,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:53:17,028 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 59 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:17,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 605 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:53:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-19 00:53:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 408. [2024-11-19 00:53:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 359 states have (on average 1.3871866295264623) internal successors, (498), 362 states have internal predecessors, (498), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 00:53:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 582 transitions. [2024-11-19 00:53:17,053 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 582 transitions. Word has length 134 [2024-11-19 00:53:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:17,053 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 582 transitions. [2024-11-19 00:53:17,053 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:53:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 582 transitions. [2024-11-19 00:53:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:17,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:17,056 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:53:17,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:53:17,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:17,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:17,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1656733667, now seen corresponding path program 1 times [2024-11-19 00:53:17,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:17,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716276862] [2024-11-19 00:53:17,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:17,365 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:53:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716276862] [2024-11-19 00:53:17,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716276862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:17,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:17,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:53:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334390788] [2024-11-19 00:53:17,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:17,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:53:17,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:17,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:53:17,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:53:17,368 INFO L87 Difference]: Start difference. First operand 408 states and 582 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:53:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:17,413 INFO L93 Difference]: Finished difference Result 816 states and 1164 transitions. [2024-11-19 00:53:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:53:17,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:53:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:17,417 INFO L225 Difference]: With dead ends: 816 [2024-11-19 00:53:17,417 INFO L226 Difference]: Without dead ends: 411 [2024-11-19 00:53:17,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:17,418 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 88 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:17,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 456 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-19 00:53:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2024-11-19 00:53:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 358 states have (on average 1.3826815642458101) internal successors, (495), 361 states have internal predecessors, (495), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 00:53:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 579 transitions. [2024-11-19 00:53:17,436 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 579 transitions. Word has length 134 [2024-11-19 00:53:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:17,437 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 579 transitions. [2024-11-19 00:53:17,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:53:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 579 transitions. [2024-11-19 00:53:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:17,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:17,439 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:53:17,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:53:17,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:17,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1937169051, now seen corresponding path program 1 times [2024-11-19 00:53:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:17,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099259347] [2024-11-19 00:53:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:18,030 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:53:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099259347] [2024-11-19 00:53:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099259347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:53:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012358293] [2024-11-19 00:53:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:18,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:53:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:18,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:53:18,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:18,033 INFO L87 Difference]: Start difference. First operand 407 states and 579 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:53:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:18,180 INFO L93 Difference]: Finished difference Result 821 states and 1162 transitions. [2024-11-19 00:53:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:53:18,181 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:53:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:18,184 INFO L225 Difference]: With dead ends: 821 [2024-11-19 00:53:18,184 INFO L226 Difference]: Without dead ends: 417 [2024-11-19 00:53:18,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:53:18,186 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 120 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:18,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 487 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:53:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-19 00:53:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2024-11-19 00:53:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 364 states have (on average 1.370879120879121) internal successors, (499), 367 states have internal predecessors, (499), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 00:53:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 583 transitions. [2024-11-19 00:53:18,206 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 583 transitions. Word has length 134 [2024-11-19 00:53:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:18,207 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 583 transitions. [2024-11-19 00:53:18,207 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:53:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 583 transitions. [2024-11-19 00:53:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:18,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:18,208 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:53:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:53:18,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:18,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1964771235, now seen corresponding path program 1 times [2024-11-19 00:53:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988565424] [2024-11-19 00:53:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:18,544 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:53:18,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:18,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988565424] [2024-11-19 00:53:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988565424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:53:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663680054] [2024-11-19 00:53:18,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:18,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:53:18,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:18,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:53:18,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:53:18,547 INFO L87 Difference]: Start difference. First operand 415 states and 583 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:53:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:18,652 INFO L93 Difference]: Finished difference Result 960 states and 1356 transitions. [2024-11-19 00:53:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:53:18,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:53:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:18,656 INFO L225 Difference]: With dead ends: 960 [2024-11-19 00:53:18,656 INFO L226 Difference]: Without dead ends: 548 [2024-11-19 00:53:18,657 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:53:18,658 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 148 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:18,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1346 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:53:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-19 00:53:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 462. [2024-11-19 00:53:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 400 states have (on average 1.365) internal successors, (546), 403 states have internal predecessors, (546), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 00:53:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 650 transitions. [2024-11-19 00:53:18,687 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 650 transitions. Word has length 134 [2024-11-19 00:53:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:18,687 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 650 transitions. [2024-11-19 00:53:18,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:53:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 650 transitions. [2024-11-19 00:53:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:53:18,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:18,689 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:53:18,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:53:18,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash 727317548, now seen corresponding path program 1 times [2024-11-19 00:53:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845960638] [2024-11-19 00:53:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:19,109 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:53:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845960638] [2024-11-19 00:53:19,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845960638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:19,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:19,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:53:19,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322864486] [2024-11-19 00:53:19,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:19,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:53:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:53:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:53:19,112 INFO L87 Difference]: Start difference. First operand 462 states and 650 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:53:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:19,480 INFO L93 Difference]: Finished difference Result 1417 states and 1997 transitions. [2024-11-19 00:53:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:53:19,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:53:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:19,488 INFO L225 Difference]: With dead ends: 1417 [2024-11-19 00:53:19,489 INFO L226 Difference]: Without dead ends: 1115 [2024-11-19 00:53:19,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:53:19,490 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 349 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:19,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1364 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:53:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-11-19 00:53:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1109. [2024-11-19 00:53:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 951 states have (on average 1.3564668769716088) internal successors, (1290), 958 states have internal predecessors, (1290), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-19 00:53:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1558 transitions. [2024-11-19 00:53:19,555 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1558 transitions. Word has length 135 [2024-11-19 00:53:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:19,557 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1558 transitions. [2024-11-19 00:53:19,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:53:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1558 transitions. [2024-11-19 00:53:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:53:19,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:19,560 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:53:19,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:53:19,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -90330902, now seen corresponding path program 1 times [2024-11-19 00:53:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:19,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690466473] [2024-11-19 00:53:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:19,723 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:53:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690466473] [2024-11-19 00:53:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690466473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:53:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67908008] [2024-11-19 00:53:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:53:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:19,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:53:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:53:19,726 INFO L87 Difference]: Start difference. First operand 1109 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:53:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:19,776 INFO L93 Difference]: Finished difference Result 1901 states and 2683 transitions. [2024-11-19 00:53:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:53:19,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:53:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:19,783 INFO L225 Difference]: With dead ends: 1901 [2024-11-19 00:53:19,783 INFO L226 Difference]: Without dead ends: 1109 [2024-11-19 00:53:19,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:53:19,786 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:19,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-19 00:53:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2024-11-19 00:53:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 951 states have (on average 1.3543638275499474) internal successors, (1288), 958 states have internal predecessors, (1288), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-19 00:53:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1556 transitions. [2024-11-19 00:53:19,850 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1556 transitions. Word has length 135 [2024-11-19 00:53:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:19,850 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1556 transitions. [2024-11-19 00:53:19,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:53:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1556 transitions. [2024-11-19 00:53:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:53:19,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:19,854 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:53:19,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:53:19,854 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:19,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:19,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1895769236, now seen corresponding path program 1 times [2024-11-19 00:53:19,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:19,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887570612] [2024-11-19 00:53:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:19,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:20,064 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:53:20,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:20,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887570612] [2024-11-19 00:53:20,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887570612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:20,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:20,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:53:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560227746] [2024-11-19 00:53:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:20,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:53:20,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:20,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:53:20,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:53:20,069 INFO L87 Difference]: Start difference. First operand 1109 states and 1556 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (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:53:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:20,147 INFO L93 Difference]: Finished difference Result 1901 states and 2679 transitions. [2024-11-19 00:53:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:53:20,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (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:53:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:20,154 INFO L225 Difference]: With dead ends: 1901 [2024-11-19 00:53:20,154 INFO L226 Difference]: Without dead ends: 1109 [2024-11-19 00:53:20,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:53:20,157 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:20,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-19 00:53:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2024-11-19 00:53:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 951 states have (on average 1.349106203995794) internal successors, (1283), 958 states have internal predecessors, (1283), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-19 00:53:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1551 transitions. [2024-11-19 00:53:20,217 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1551 transitions. Word has length 135 [2024-11-19 00:53:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:20,217 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1551 transitions. [2024-11-19 00:53:20,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (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:53:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1551 transitions. [2024-11-19 00:53:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:53:20,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:20,220 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:53:20,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:53:20,221 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:20,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1637603798, now seen corresponding path program 1 times [2024-11-19 00:53:20,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:20,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572411328] [2024-11-19 00:53:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:21,165 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:53:21,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:21,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572411328] [2024-11-19 00:53:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572411328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:21,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:21,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:53:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578140657] [2024-11-19 00:53:21,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:21,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:53:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:53:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:53:21,167 INFO L87 Difference]: Start difference. First operand 1109 states and 1551 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:53:21,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:21,790 INFO L93 Difference]: Finished difference Result 1355 states and 1891 transitions. [2024-11-19 00:53:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 00:53:21,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:53:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:21,796 INFO L225 Difference]: With dead ends: 1355 [2024-11-19 00:53:21,797 INFO L226 Difference]: Without dead ends: 1113 [2024-11-19 00:53:21,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:53:21,798 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 361 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:21,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1676 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:53:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-19 00:53:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1103. [2024-11-19 00:53:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 945 states have (on average 1.348148148148148) internal successors, (1274), 952 states have internal predecessors, (1274), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-19 00:53:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1542 transitions. [2024-11-19 00:53:21,889 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1542 transitions. Word has length 135 [2024-11-19 00:53:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:21,889 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1542 transitions. [2024-11-19 00:53:21,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:53:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1542 transitions. [2024-11-19 00:53:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:53:21,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:21,891 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:53:21,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:53:21,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:21,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash -757915734, now seen corresponding path program 1 times [2024-11-19 00:53:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829570630] [2024-11-19 00:53:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:22,508 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:53:22,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:22,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829570630] [2024-11-19 00:53:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829570630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:53:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324253922] [2024-11-19 00:53:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:22,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:53:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:53:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:53:22,511 INFO L87 Difference]: Start difference. First operand 1103 states and 1542 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:53:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:23,176 INFO L93 Difference]: Finished difference Result 2118 states and 2968 transitions. [2024-11-19 00:53:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:53:23,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:53:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:23,183 INFO L225 Difference]: With dead ends: 2118 [2024-11-19 00:53:23,183 INFO L226 Difference]: Without dead ends: 1332 [2024-11-19 00:53:23,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:53:23,186 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 248 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:23,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2093 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:53:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-19 00:53:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1318. [2024-11-19 00:53:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1125 states have (on average 1.3484444444444443) internal successors, (1517), 1133 states have internal predecessors, (1517), 164 states have call successors, (164), 28 states have call predecessors, (164), 28 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2024-11-19 00:53:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1845 transitions. [2024-11-19 00:53:23,279 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1845 transitions. Word has length 135 [2024-11-19 00:53:23,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:23,280 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1845 transitions. [2024-11-19 00:53:23,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:53:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1845 transitions. [2024-11-19 00:53:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 00:53:23,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:23,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, 1] [2024-11-19 00:53:23,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:53:23,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:23,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1575564184, now seen corresponding path program 1 times [2024-11-19 00:53:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:23,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131933990] [2024-11-19 00:53:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:23,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:23,914 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:53:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131933990] [2024-11-19 00:53:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131933990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:53:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008530742] [2024-11-19 00:53:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:23,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:53:23,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:53:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:53:23,917 INFO L87 Difference]: Start difference. First operand 1318 states and 1845 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:53:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:24,364 INFO L93 Difference]: Finished difference Result 1795 states and 2513 transitions. [2024-11-19 00:53:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:53:24,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:53:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:24,370 INFO L225 Difference]: With dead ends: 1795 [2024-11-19 00:53:24,370 INFO L226 Difference]: Without dead ends: 794 [2024-11-19 00:53:24,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:53:24,373 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 381 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:24,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1587 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:53:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-19 00:53:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 784. [2024-11-19 00:53:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 666 states have (on average 1.3333333333333333) internal successors, (888), 669 states have internal predecessors, (888), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-19 00:53:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1088 transitions. [2024-11-19 00:53:24,427 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1088 transitions. Word has length 135 [2024-11-19 00:53:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:24,428 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1088 transitions. [2024-11-19 00:53:24,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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:53:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1088 transitions. [2024-11-19 00:53:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:53:24,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:24,432 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] [2024-11-19 00:53:24,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:53:24,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:24,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash -775867618, now seen corresponding path program 1 times [2024-11-19 00:53:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:24,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627493106] [2024-11-19 00:53:24,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:24,841 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:53:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:24,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627493106] [2024-11-19 00:53:24,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627493106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:24,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:24,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:53:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200298336] [2024-11-19 00:53:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:24,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:53:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:53:24,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:53:24,844 INFO L87 Difference]: Start difference. First operand 784 states and 1088 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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:53:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:25,165 INFO L93 Difference]: Finished difference Result 1022 states and 1417 transitions. [2024-11-19 00:53:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:53:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 136 [2024-11-19 00:53:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:25,170 INFO L225 Difference]: With dead ends: 1022 [2024-11-19 00:53:25,171 INFO L226 Difference]: Without dead ends: 786 [2024-11-19 00:53:25,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:53:25,172 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 305 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:25,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1438 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:53:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-19 00:53:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 780. [2024-11-19 00:53:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 662 states have (on average 1.3308157099697886) internal successors, (881), 665 states have internal predecessors, (881), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-19 00:53:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1081 transitions. [2024-11-19 00:53:25,221 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1081 transitions. Word has length 136 [2024-11-19 00:53:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:25,222 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1081 transitions. [2024-11-19 00:53:25,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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:53:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1081 transitions. [2024-11-19 00:53:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 00:53:25,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:25,224 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] [2024-11-19 00:53:25,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:53:25,224 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:25,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1850344608, now seen corresponding path program 1 times [2024-11-19 00:53:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:25,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377102448] [2024-11-19 00:53:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:25,467 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:53:25,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:25,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377102448] [2024-11-19 00:53:25,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377102448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:25,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:25,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:53:25,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642886169] [2024-11-19 00:53:25,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:25,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:53:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:53:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:25,471 INFO L87 Difference]: Start difference. First operand 780 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (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:53:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:25,557 INFO L93 Difference]: Finished difference Result 1241 states and 1722 transitions. [2024-11-19 00:53:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:53:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (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 136 [2024-11-19 00:53:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:25,561 INFO L225 Difference]: With dead ends: 1241 [2024-11-19 00:53:25,562 INFO L226 Difference]: Without dead ends: 778 [2024-11-19 00:53:25,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:53:25,563 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 139 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:25,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 868 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-19 00:53:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 772. [2024-11-19 00:53:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 654 states have (on average 1.3256880733944953) internal successors, (867), 657 states have internal predecessors, (867), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-19 00:53:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1067 transitions. [2024-11-19 00:53:25,613 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1067 transitions. Word has length 136 [2024-11-19 00:53:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:25,613 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1067 transitions. [2024-11-19 00:53:25,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (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:53:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1067 transitions. [2024-11-19 00:53:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:53:25,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:25,615 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:53:25,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:53:25,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:25,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -768849576, now seen corresponding path program 1 times [2024-11-19 00:53:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:25,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36473732] [2024-11-19 00:53:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:25,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 00:53:25,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36473732] [2024-11-19 00:53:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36473732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:53:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170033882] [2024-11-19 00:53:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:25,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:53:25,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:53:25,807 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:53:25,808 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:53:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:26,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:53:26,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:26,162 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:53:26,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:53:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170033882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:53:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-19 00:53:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129764453] [2024-11-19 00:53:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:26,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:53:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:26,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:53:26,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:53:26,165 INFO L87 Difference]: Start difference. First operand 772 states and 1067 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:53:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:26,230 INFO L93 Difference]: Finished difference Result 1573 states and 2171 transitions. [2024-11-19 00:53:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:53:26,230 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:53:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:26,235 INFO L225 Difference]: With dead ends: 1573 [2024-11-19 00:53:26,235 INFO L226 Difference]: Without dead ends: 804 [2024-11-19 00:53:26,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:53:26,237 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:26,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 736 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-19 00:53:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2024-11-19 00:53:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 686 states have (on average 1.3104956268221575) internal successors, (899), 689 states have internal predecessors, (899), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-19 00:53:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1099 transitions. [2024-11-19 00:53:26,286 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1099 transitions. Word has length 139 [2024-11-19 00:53:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:26,286 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1099 transitions. [2024-11-19 00:53:26,287 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:53:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1099 transitions. [2024-11-19 00:53:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-19 00:53:26,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:26,288 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:53:26,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:53:26,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:53:26,489 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:26,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -879953882, now seen corresponding path program 1 times [2024-11-19 00:53:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:26,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176273781] [2024-11-19 00:53:26,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:26,558 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:53:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176273781] [2024-11-19 00:53:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176273781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:26,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:26,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:53:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225274565] [2024-11-19 00:53:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:26,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:53:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:26,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:53:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:53:26,561 INFO L87 Difference]: Start difference. First operand 804 states and 1099 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:53:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:26,603 INFO L93 Difference]: Finished difference Result 1589 states and 2171 transitions. [2024-11-19 00:53:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:53:26,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:53:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:26,608 INFO L225 Difference]: With dead ends: 1589 [2024-11-19 00:53:26,609 INFO L226 Difference]: Without dead ends: 788 [2024-11-19 00:53:26,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:53:26,611 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:26,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-19 00:53:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2024-11-19 00:53:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 670 states have (on average 1.2940298507462686) internal successors, (867), 673 states have internal predecessors, (867), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-19 00:53:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1067 transitions. [2024-11-19 00:53:26,667 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1067 transitions. Word has length 139 [2024-11-19 00:53:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:26,668 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1067 transitions. [2024-11-19 00:53:26,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:53:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1067 transitions. [2024-11-19 00:53:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:53:26,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:26,670 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, 1, 1] [2024-11-19 00:53:26,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:53:26,670 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1517237421, now seen corresponding path program 1 times [2024-11-19 00:53:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042702836] [2024-11-19 00:53:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:26,879 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:53:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042702836] [2024-11-19 00:53:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042702836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:26,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:26,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:53:26,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014346526] [2024-11-19 00:53:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:26,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:53:26,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:26,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:53:26,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:26,882 INFO L87 Difference]: Start difference. First operand 788 states and 1067 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:53:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:26,959 INFO L93 Difference]: Finished difference Result 1664 states and 2242 transitions. [2024-11-19 00:53:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:53:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 141 [2024-11-19 00:53:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:26,965 INFO L225 Difference]: With dead ends: 1664 [2024-11-19 00:53:26,965 INFO L226 Difference]: Without dead ends: 879 [2024-11-19 00:53:26,966 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:53:26,967 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 37 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:26,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 577 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-19 00:53:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 812. [2024-11-19 00:53:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 694 states have (on average 1.276657060518732) internal successors, (886), 697 states have internal predecessors, (886), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-19 00:53:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1086 transitions. [2024-11-19 00:53:27,013 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1086 transitions. Word has length 141 [2024-11-19 00:53:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:27,013 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1086 transitions. [2024-11-19 00:53:27,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:53:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1086 transitions. [2024-11-19 00:53:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:53:27,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:27,015 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, 1, 1] [2024-11-19 00:53:27,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:53:27,015 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:27,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2104043435, now seen corresponding path program 1 times [2024-11-19 00:53:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958112582] [2024-11-19 00:53:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:27,509 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:53:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958112582] [2024-11-19 00:53:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958112582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:53:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040515294] [2024-11-19 00:53:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:53:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:53:27,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:53:27,512 INFO L87 Difference]: Start difference. First operand 812 states and 1086 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:53:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:27,907 INFO L93 Difference]: Finished difference Result 1599 states and 2094 transitions. [2024-11-19 00:53:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:53:27,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 141 [2024-11-19 00:53:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:27,914 INFO L225 Difference]: With dead ends: 1599 [2024-11-19 00:53:27,914 INFO L226 Difference]: Without dead ends: 1081 [2024-11-19 00:53:27,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:53:27,917 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 209 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:27,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1085 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:53:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-19 00:53:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1066. [2024-11-19 00:53:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 904 states have (on average 1.2334070796460177) internal successors, (1115), 912 states have internal predecessors, (1115), 133 states have call successors, (133), 28 states have call predecessors, (133), 28 states have return successors, (133), 125 states have call predecessors, (133), 133 states have call successors, (133) [2024-11-19 00:53:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1381 transitions. [2024-11-19 00:53:27,991 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1381 transitions. Word has length 141 [2024-11-19 00:53:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:27,992 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1381 transitions. [2024-11-19 00:53:27,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:53:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1381 transitions. [2024-11-19 00:53:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:53:27,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:27,994 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, 1, 1] [2024-11-19 00:53:27,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 00:53:27,994 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:27,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1829283821, now seen corresponding path program 1 times [2024-11-19 00:53:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:27,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97833226] [2024-11-19 00:53:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:28,417 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:53:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97833226] [2024-11-19 00:53:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97833226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:28,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:53:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744709549] [2024-11-19 00:53:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:28,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:53:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:53:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:53:28,420 INFO L87 Difference]: Start difference. First operand 1066 states and 1381 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:53:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:28,805 INFO L93 Difference]: Finished difference Result 2285 states and 2940 transitions. [2024-11-19 00:53:28,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:53:28,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 141 [2024-11-19 00:53:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:28,812 INFO L225 Difference]: With dead ends: 2285 [2024-11-19 00:53:28,813 INFO L226 Difference]: Without dead ends: 1222 [2024-11-19 00:53:28,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:53:28,816 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 162 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:28,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 865 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:53:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-11-19 00:53:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1212. [2024-11-19 00:53:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1025 states have (on average 1.2165853658536585) internal successors, (1247), 1036 states have internal predecessors, (1247), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-19 00:53:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1551 transitions. [2024-11-19 00:53:28,906 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1551 transitions. Word has length 141 [2024-11-19 00:53:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:28,907 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1551 transitions. [2024-11-19 00:53:28,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:53:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1551 transitions. [2024-11-19 00:53:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 00:53:28,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:28,909 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, 1, 1, 1] [2024-11-19 00:53:28,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 00:53:28,910 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:28,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1389380650, now seen corresponding path program 1 times [2024-11-19 00:53:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:28,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322039797] [2024-11-19 00:53:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:28,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:29,094 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:53:29,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322039797] [2024-11-19 00:53:29,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322039797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:29,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:29,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:53:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082937063] [2024-11-19 00:53:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:29,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:53:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:29,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:53:29,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:53:29,096 INFO L87 Difference]: Start difference. First operand 1212 states and 1551 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:53:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:29,158 INFO L93 Difference]: Finished difference Result 2399 states and 3066 transitions. [2024-11-19 00:53:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:53:29,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 142 [2024-11-19 00:53:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:29,165 INFO L225 Difference]: With dead ends: 2399 [2024-11-19 00:53:29,165 INFO L226 Difference]: Without dead ends: 1190 [2024-11-19 00:53:29,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:53:29,168 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:29,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-19 00:53:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2024-11-19 00:53:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1003 states have (on average 1.1994017946161515) internal successors, (1203), 1014 states have internal predecessors, (1203), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-19 00:53:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1507 transitions. [2024-11-19 00:53:29,250 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1507 transitions. Word has length 142 [2024-11-19 00:53:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:29,250 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1507 transitions. [2024-11-19 00:53:29,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:53:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1507 transitions. [2024-11-19 00:53:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 00:53:29,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:29,255 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, 1, 1, 1] [2024-11-19 00:53:29,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 00:53:29,256 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:29,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash -955255966, now seen corresponding path program 1 times [2024-11-19 00:53:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654463229] [2024-11-19 00:53:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:29,648 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:53:29,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654463229] [2024-11-19 00:53:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654463229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:29,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:29,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:53:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141463552] [2024-11-19 00:53:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:29,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:53:29,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:29,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:53:29,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:53:29,652 INFO L87 Difference]: Start difference. First operand 1190 states and 1507 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:53:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:29,815 INFO L93 Difference]: Finished difference Result 1233 states and 1559 transitions. [2024-11-19 00:53:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:53:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 142 [2024-11-19 00:53:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:29,822 INFO L225 Difference]: With dead ends: 1233 [2024-11-19 00:53:29,822 INFO L226 Difference]: Without dead ends: 1231 [2024-11-19 00:53:29,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:53:29,823 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 120 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:29,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1234 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:53:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-19 00:53:29,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1229. [2024-11-19 00:53:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1042 states have (on average 1.1871401151631478) internal successors, (1237), 1053 states have internal predecessors, (1237), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-19 00:53:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1541 transitions. [2024-11-19 00:53:29,903 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1541 transitions. Word has length 142 [2024-11-19 00:53:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:29,904 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1541 transitions. [2024-11-19 00:53:29,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:53:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1541 transitions. [2024-11-19 00:53:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 00:53:29,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:29,906 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, 1, 1, 1] [2024-11-19 00:53:29,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 00:53:29,906 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:29,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1027642524, now seen corresponding path program 1 times [2024-11-19 00:53:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654795872] [2024-11-19 00:53:29,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:53:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007537628] [2024-11-19 00:53:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:29,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:53:29,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:53:29,977 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:53:29,978 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:53:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:30,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 00:53:30,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:30,552 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:53:31,552 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 39 treesize of output 27 [2024-11-19 00:53:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-19 00:53:31,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:53:32,024 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 52 treesize of output 48 [2024-11-19 00:53:32,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (mod (select (select |c_#memory_int#9| c_~var_1_11_Pointer~0.base) c_~var_1_11_Pointer~0.offset) 256) 1)) (.cse1 (= c_~var_1_6_Pointer~0.base |c_~#var_1_6~0.base|)) (.cse0 (= c_~var_1_6_Pointer~0.offset |c_~#var_1_6~0.offset|))) (or (and .cse0 .cse1 (forall ((v_z_3 Int) (v_y_3 Int)) (let ((.cse2 (+ v_z_3 (* 65536 v_y_3)))) (or (= .cse2 0) (< (div 10 v_z_3) .cse3) (< 65535 .cse2) (< .cse2 0))))) (and (forall ((v_z_4 Int)) (< (div 10 v_z_4) .cse3)) (or (not .cse1) (not .cse0))))) is different from false [2024-11-19 00:53:32,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:53:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654795872] [2024-11-19 00:53:32,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 00:53:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007537628] [2024-11-19 00:53:32,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007537628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:53:32,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:53:32,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-19 00:53:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775285624] [2024-11-19 00:53:32,143 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 00:53:32,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:53:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:53:32,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:53:32,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=162, Unknown=1, NotChecked=26, Total=240 [2024-11-19 00:53:32,145 INFO L87 Difference]: Start difference. First operand 1229 states and 1541 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 00:53:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:32,696 INFO L93 Difference]: Finished difference Result 2385 states and 2987 transitions. [2024-11-19 00:53:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:53:32,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 142 [2024-11-19 00:53:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:32,703 INFO L225 Difference]: With dead ends: 2385 [2024-11-19 00:53:32,703 INFO L226 Difference]: Without dead ends: 1159 [2024-11-19 00:53:32,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=439, Unknown=1, NotChecked=46, Total=650 [2024-11-19 00:53:32,706 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 187 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:32,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1100 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:53:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-19 00:53:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1141. [2024-11-19 00:53:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 964 states have (on average 1.1898340248962656) internal successors, (1147), 973 states have internal predecessors, (1147), 142 states have call successors, (142), 34 states have call predecessors, (142), 34 states have return successors, (142), 133 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-19 00:53:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1431 transitions. [2024-11-19 00:53:32,780 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1431 transitions. Word has length 142 [2024-11-19 00:53:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:32,780 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1431 transitions. [2024-11-19 00:53:32,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 00:53:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1431 transitions. [2024-11-19 00:53:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-19 00:53:32,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:32,782 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, 1, 1, 1] [2024-11-19 00:53:32,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 00:53:32,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 00:53:32,983 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:32,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash 763706976, now seen corresponding path program 1 times [2024-11-19 00:53:32,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:53:32,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904142109] [2024-11-19 00:53:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:53:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:53:33,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804118820] [2024-11-19 00:53:33,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:33,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:53:33,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:53:33,082 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:53:33,084 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:53:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:53:33,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:53:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:53:33,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:53:33,888 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:53:33,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:53:33,913 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:53:34,092 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,SelfDestructingSolverStorable27 [2024-11-19 00:53:34,096 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] [2024-11-19 00:53:34,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:53:34,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:53:34 BoogieIcfgContainer [2024-11-19 00:53:34,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:53:34,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:53:34,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:53:34,307 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:53:34,308 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:53:11" (3/4) ... [2024-11-19 00:53:34,311 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:53:34,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:53:34,314 INFO L158 Benchmark]: Toolchain (without parser) took 24261.50ms. Allocated memory was 155.2MB in the beginning and 767.6MB in the end (delta: 612.4MB). Free memory was 116.7MB in the beginning and 651.7MB in the end (delta: -535.1MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-11-19 00:53:34,314 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:53:34,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.91ms. Allocated memory is still 155.2MB. Free memory was 116.7MB in the beginning and 100.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:53:34,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.11ms. Allocated memory is still 155.2MB. Free memory was 100.0MB in the beginning and 96.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:53:34,315 INFO L158 Benchmark]: Boogie Preprocessor took 83.54ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 90.9MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:53:34,317 INFO L158 Benchmark]: RCFGBuilder took 839.41ms. Allocated memory is still 155.2MB. Free memory was 90.9MB in the beginning and 47.6MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-19 00:53:34,317 INFO L158 Benchmark]: TraceAbstraction took 22918.76ms. Allocated memory was 155.2MB in the beginning and 767.6MB in the end (delta: 612.4MB). Free memory was 46.9MB in the beginning and 652.8MB in the end (delta: -605.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-19 00:53:34,318 INFO L158 Benchmark]: Witness Printer took 6.00ms. Allocated memory is still 767.6MB. Free memory was 652.8MB in the beginning and 651.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:53:34,318 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.14ms. Allocated memory is still 113.2MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.91ms. Allocated memory is still 155.2MB. Free memory was 116.7MB in the beginning and 100.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.11ms. Allocated memory is still 155.2MB. Free memory was 100.0MB in the beginning and 96.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.54ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 90.9MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 839.41ms. Allocated memory is still 155.2MB. Free memory was 90.9MB in the beginning and 47.6MB in the end (delta: 43.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22918.76ms. Allocated memory was 155.2MB in the beginning and 767.6MB in the end (delta: 612.4MB). Free memory was 46.9MB in the beginning and 652.8MB in the end (delta: -605.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Witness Printer took 6.00ms. Allocated memory is still 767.6MB. Free memory was 652.8MB in the beginning and 651.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 25; [L22] unsigned short int var_1_1 = 25; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 1; [L24] unsigned char var_1_2 = 1; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed char var_1_5 = 16; [L26] signed char var_1_5 = 16; [L27] signed char* var_1_5_Pointer = &(var_1_5); [L28] unsigned short int var_1_6 = 16; [L28] unsigned short int var_1_6 = 16; [L29] unsigned short int* var_1_6_Pointer = &(var_1_6); [L30] signed char var_1_7 = 4; [L30] signed char var_1_7 = 4; [L31] signed char* var_1_7_Pointer = &(var_1_7); [L32] unsigned short int var_1_8 = 2; [L32] unsigned short int var_1_8 = 2; [L33] unsigned short int* var_1_8_Pointer = &(var_1_8); [L34] signed char var_1_9 = 64; [L34] signed char var_1_9 = 64; [L35] signed char* var_1_9_Pointer = &(var_1_9); [L36] signed char var_1_10 = 0; [L36] signed char var_1_10 = 0; [L37] signed char* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_11 = 16; [L38] unsigned char var_1_11 = 16; [L39] unsigned char* var_1_11_Pointer = &(var_1_11); [L40] double var_1_12 = 128.4; [L40] double var_1_12 = 128.4; [L41] double* var_1_12_Pointer = &(var_1_12); [L42] double var_1_13 = 50.2; [L42] double var_1_13 = 50.2; [L43] double* var_1_13_Pointer = &(var_1_13); [L44] double var_1_14 = 3.8; [L44] double var_1_14 = 3.8; [L45] double* var_1_14_Pointer = &(var_1_14); [L46] double var_1_15 = 25.1; [L46] double var_1_15 = 25.1; [L47] double* var_1_15_Pointer = &(var_1_15); VAL [isInitial=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L75] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L76] var_1_6 = __VERIFIER_nondet_ushort() [L77] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_6 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_6 <= 65535) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] var_1_7 = __VERIFIER_nondet_char() [L81] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] var_1_9 = __VERIFIER_nondet_char() [L84] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_10 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_10 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_10 <= 64) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_12 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] var_1_13 = __VERIFIER_nondet_double() [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_14) [L94] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F [L94] EXPR \read(var_1_14) [L94] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] 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, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] 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, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not((var_1_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, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not((var_1_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, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_15 = __VERIFIER_nondet_double() [L96] EXPR \read(var_1_15) [L96] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F [L96] EXPR \read(var_1_15) [L96] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] 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, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] 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, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] 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, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] 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, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] RET updateVariables() [L110] CALL step() [L51] EXPR \read(*var_1_12_Pointer) [L51] EXPR \read(*var_1_13_Pointer) [L51] EXPR \read(*var_1_14_Pointer) [L51] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L51] EXPR ((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))) [L51] EXPR ((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L51] COND FALSE !((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) [L54] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] COND FALSE !((*(var_1_2_Pointer))) [L57] EXPR \read(*var_1_1_Pointer) [L57] ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) [L57] EXPR \read(*var_1_11_Pointer) [L57] EXPR \read(*var_1_6_Pointer) [L57] ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L57] COND FALSE !(((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) [L60] (*(var_1_5_Pointer)) = 5 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR \read(*var_1_11_Pointer) [L62] unsigned char stepLocal_1 = (*(var_1_11_Pointer)); [L63] EXPR \read(*var_1_2_Pointer) [L63] unsigned char stepLocal_0 = (*(var_1_2_Pointer)); [L64] stepLocal_0 || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) VAL [isInitial=1, stepLocal_1=16, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L64] stepLocal_0 || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_11_Pointer) [L64] stepLocal_0 || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) VAL [isInitial=1, stepLocal_1=16, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L64] COND TRUE stepLocal_0 || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) [L65] EXPR \read(*var_1_9_Pointer) [L65] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L65] COND FALSE !(stepLocal_1 < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1 [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5))) [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR \read(*var_1_6_Pointer) [L101] EXPR ((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)) [L101] EXPR \read(*var_1_5_Pointer) [L101] EXPR (((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer)))))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer)))))))) [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR (*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR (*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))) [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR \read(*var_1_9_Pointer) [L101] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1 [L101] EXPR ((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer)))))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))))) && (((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))))) && (((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L101] EXPR \read(*var_1_12_Pointer) [L101] EXPR \read(*var_1_13_Pointer) [L101] EXPR \read(*var_1_14_Pointer) [L101] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))) [L101] EXPR ((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L101] EXPR \read(*var_1_11_Pointer) [L101] EXPR ((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))))) && (((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101-L102] return ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_11_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) && ((((*(var_1_1_Pointer)) == 16) || ((*(var_1_11_Pointer)) < (10 / (*(var_1_6_Pointer))))) ? ((*(var_1_5_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_5_Pointer)) == ((signed char) 5)))) && (((*(var_1_2_Pointer)) || ((*(var_1_11_Pointer)) >= (*(var_1_11_Pointer)))) ? (((*(var_1_11_Pointer)) < (((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))) - 16)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_10_Pointer))) > (32)) ? ((*(var_1_10_Pointer))) : (32))))) : 1) : ((*(var_1_8_Pointer)) == ((unsigned short int) (((((*(var_1_9_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_11_Pointer))))))))) && (((((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) <= (256.625 * ((((1.875) > ((*(var_1_15_Pointer)))) ? (1.875) : ((*(var_1_15_Pointer))))))) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 28, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3196 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3196 mSDsluCounter, 22276 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16794 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3199 IncrementalHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 5482 mSDtfsCounter, 3199 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 893 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1318occurred in iteration=16, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 363 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 4502 NumberOfCodeBlocks, 4502 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4046 ConstructedInterpolants, 0 QuantifiedInterpolants, 11146 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2290 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 12282/12600 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:53:34,355 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-13.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 cdcd3642c2c30159222eee25927f49b3d8b3f6c368c10235d87e2600cd134b94 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:53:36,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:53:36,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:53:36,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:53:36,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:53:36,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:53:36,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:53:36,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:53:36,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:53:36,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:53:36,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:53:36,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:53:36,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:53:36,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:53:36,784 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:53:36,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:53:36,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:53:36,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:53:36,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:53:36,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:53:36,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:53:36,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:53:36,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:53:36,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:53:36,787 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:53:36,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:53:36,788 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:53:36,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:53:36,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:53:36,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:53:36,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:53:36,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:53:36,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:53:36,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:53:36,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:53:36,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:53:36,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:53:36,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:53:36,792 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:53:36,792 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:53:36,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:53:36,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:53:36,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:53:36,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:53:36,793 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 -> cdcd3642c2c30159222eee25927f49b3d8b3f6c368c10235d87e2600cd134b94 [2024-11-19 00:53:37,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:53:37,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:53:37,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:53:37,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:53:37,175 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:53:37,176 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-13.i [2024-11-19 00:53:38,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:53:39,029 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:53:39,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-13.i [2024-11-19 00:53:39,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eab60750/1711d7d2353f44dabb647190068e4b95/FLAG8991d05a6 [2024-11-19 00:53:39,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eab60750/1711d7d2353f44dabb647190068e4b95 [2024-11-19 00:53:39,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:53:39,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:53:39,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:53:39,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:53:39,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:53:39,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e03e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39, skipping insertion in model container [2024-11-19 00:53:39,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:53:39,280 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-13.i[916,929] [2024-11-19 00:53:39,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:53:39,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:53:39,393 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-13.i[916,929] [2024-11-19 00:53:39,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:53:39,465 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:53:39,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39 WrapperNode [2024-11-19 00:53:39,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:53:39,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:53:39,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:53:39,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:53:39,473 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:53:39" (1/1) ... [2024-11-19 00:53:39,493 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:53:39" (1/1) ... [2024-11-19 00:53:39,539 INFO L138 Inliner]: procedures = 33, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-11-19 00:53:39,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:53:39,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:53:39,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:53:39,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:53:39,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,612 INFO L175 MemorySlicer]: Split 115 memory accesses to 14 slices as follows [2, 5, 8, 5, 7, 6, 5, 10, 10, 23, 8, 8, 8, 10]. 20 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, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-11-19 00:53:39,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:53:39,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:53:39,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:53:39,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:53:39,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (1/1) ... [2024-11-19 00:53:39,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:53:39,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:53:39,737 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:53:39,745 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:53:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:53:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:53:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:53:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:53:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:53:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:53:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:53:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-19 00:53:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-19 00:53:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-19 00:53:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-19 00:53:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-19 00:53:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-19 00:53:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-19 00:53:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-19 00:53:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:53:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:53:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:53:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:53:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:53:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:53:39,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-19 00:53:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-19 00:53:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-19 00:53:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-19 00:53:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-19 00:53:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-19 00:53:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-19 00:53:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-19 00:53:39,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:53:39,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:53:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:53:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:53:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:53:39,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:53:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 00:53:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 00:53:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 00:53:39,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 00:53:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 00:53:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 00:53:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 00:53:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-19 00:53:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:53:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:53:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:53:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-19 00:53:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 00:53:39,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 00:53:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-19 00:53:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:53:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:53:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:53:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:53:39,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:53:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:53:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-19 00:53:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-19 00:53:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-19 00:53:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-19 00:53:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-19 00:53:39,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-19 00:53:39,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-19 00:53:39,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-19 00:53:39,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:53:39,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:53:39,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:53:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:53:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:53:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:53:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-19 00:53:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-19 00:53:39,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-19 00:53:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-19 00:53:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-19 00:53:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-19 00:53:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-19 00:53:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-19 00:53:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:53:39,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:53:39,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:53:39,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:53:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:53:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:53:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:53:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:53:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:53:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:53:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 00:53:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 00:53:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 00:53:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 00:53:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 00:53:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 00:53:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 00:53:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-19 00:53:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:53:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:53:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:53:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:53:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:53:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:53:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-19 00:53:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-19 00:53:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-19 00:53:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-19 00:53:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-19 00:53:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-19 00:53:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-19 00:53:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-19 00:53:40,071 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:53:40,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:53:46,260 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-19 00:53:46,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:53:46,276 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:53:46,276 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:53:46,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:53:46 BoogieIcfgContainer [2024-11-19 00:53:46,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:53:46,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:53:46,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:53:46,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:53:46,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:53:39" (1/3) ... [2024-11-19 00:53:46,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15480181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:53:46, skipping insertion in model container [2024-11-19 00:53:46,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:53:39" (2/3) ... [2024-11-19 00:53:46,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15480181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:53:46, skipping insertion in model container [2024-11-19 00:53:46,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:53:46" (3/3) ... [2024-11-19 00:53:46,285 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-13.i [2024-11-19 00:53:46,301 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:53:46,301 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:53:46,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:53:46,378 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;@6ca88f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:53:46,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:53:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 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:53:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:53:46,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:46,400 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] [2024-11-19 00:53:46,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:46,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1910210082, now seen corresponding path program 1 times [2024-11-19 00:53:46,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:53:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348762986] [2024-11-19 00:53:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:46,421 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:53:46,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:53:46,422 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:53:46,424 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:53:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:47,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:53:47,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 00:53:47,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:53:47,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:53:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348762986] [2024-11-19 00:53:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348762986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:47,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:53:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112404117] [2024-11-19 00:53:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:47,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:53:47,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:53:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:53:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:53:47,137 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 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 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:53:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:47,167 INFO L93 Difference]: Finished difference Result 217 states and 341 transitions. [2024-11-19 00:53:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:53:47,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-19 00:53:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:47,176 INFO L225 Difference]: With dead ends: 217 [2024-11-19 00:53:47,176 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 00:53:47,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:53:47,182 INFO L432 NwaCegarLoop]: 159 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, 159 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:53:47,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 00:53:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 00:53:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:53:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2024-11-19 00:53:47,234 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2024-11-19 00:53:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:47,234 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2024-11-19 00:53:47,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:53:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2024-11-19 00:53:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:53:47,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:47,238 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] [2024-11-19 00:53:47,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:53:47,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:53:47,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:47,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:47,441 INFO L85 PathProgramCache]: Analyzing trace with hash 660310348, now seen corresponding path program 1 times [2024-11-19 00:53:47,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:53:47,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743118406] [2024-11-19 00:53:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:47,442 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:53:47,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:53:47,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:53:47,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:53:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:48,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:53:48,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:48,633 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 34 treesize of output 22 [2024-11-19 00:53:48,652 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:53:48,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:53:48,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:53:48,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743118406] [2024-11-19 00:53:48,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743118406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:48,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:48,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:53:48,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865404594] [2024-11-19 00:53:48,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:48,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:53:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:53:48,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:53:48,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:53:48,657 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:53:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:48,779 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2024-11-19 00:53:48,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:53:48,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 131 [2024-11-19 00:53:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:48,785 INFO L225 Difference]: With dead ends: 318 [2024-11-19 00:53:48,786 INFO L226 Difference]: Without dead ends: 213 [2024-11-19 00:53:48,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:48,788 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 87 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:48,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 455 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:53:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-19 00:53:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2024-11-19 00:53:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 176 states have (on average 1.4204545454545454) internal successors, (250), 176 states have internal predecessors, (250), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:53:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 310 transitions. [2024-11-19 00:53:48,831 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 310 transitions. Word has length 131 [2024-11-19 00:53:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:48,832 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 310 transitions. [2024-11-19 00:53:48,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:53:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2024-11-19 00:53:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:53:48,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:48,838 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] [2024-11-19 00:53:48,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:53:49,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:53:49,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:49,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:49,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1333834358, now seen corresponding path program 1 times [2024-11-19 00:53:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:53:49,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205090298] [2024-11-19 00:53:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:49,041 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:53:49,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:53:49,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:53:49,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:53:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:49,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:53:49,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:53:50,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:53:50,532 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:53:50,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:53:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205090298] [2024-11-19 00:53:50,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205090298] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:53:50,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:53:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-19 00:53:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006752114] [2024-11-19 00:53:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:50,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:53:50,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:53:50,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:53:50,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:53:50,535 INFO L87 Difference]: Start difference. First operand 209 states and 310 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (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:53:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:50,696 INFO L93 Difference]: Finished difference Result 461 states and 684 transitions. [2024-11-19 00:53:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:53:50,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (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 131 [2024-11-19 00:53:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:50,701 INFO L225 Difference]: With dead ends: 461 [2024-11-19 00:53:50,701 INFO L226 Difference]: Without dead ends: 255 [2024-11-19 00:53:50,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:53:50,704 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 60 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:50,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 605 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:53:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-19 00:53:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 214. [2024-11-19 00:53:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 181 states have (on average 1.4143646408839778) internal successors, (256), 181 states have internal predecessors, (256), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:53:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 316 transitions. [2024-11-19 00:53:50,724 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 316 transitions. Word has length 131 [2024-11-19 00:53:50,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:50,725 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 316 transitions. [2024-11-19 00:53:50,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (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:53:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2024-11-19 00:53:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 00:53:50,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:50,728 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] [2024-11-19 00:53:50,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:53:50,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:53:50,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1681269260, now seen corresponding path program 1 times [2024-11-19 00:53:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:53:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515323330] [2024-11-19 00:53:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:50,931 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:53:50,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:53:50,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:53:50,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:53:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:51,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:53:51,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:51,501 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:53:51,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:53:51,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:53:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515323330] [2024-11-19 00:53:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515323330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:51,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:51,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:53:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585608589] [2024-11-19 00:53:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:51,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:53:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:53:51,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:53:51,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:53:51,507 INFO L87 Difference]: Start difference. First operand 214 states and 316 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:53:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:51,556 INFO L93 Difference]: Finished difference Result 429 states and 635 transitions. [2024-11-19 00:53:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:53:51,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 131 [2024-11-19 00:53:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:51,562 INFO L225 Difference]: With dead ends: 429 [2024-11-19 00:53:51,562 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 00:53:51,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 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:53:51,565 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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:53:51,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:53:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 00:53:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-19 00:53:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.4054054054054055) internal successors, (260), 185 states have internal predecessors, (260), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:53:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2024-11-19 00:53:51,597 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 131 [2024-11-19 00:53:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:51,598 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2024-11-19 00:53:51,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:53:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2024-11-19 00:53:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 00:53:51,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:51,600 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] [2024-11-19 00:53:51,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:53:51,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:53:51,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:51,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash 122364423, now seen corresponding path program 1 times [2024-11-19 00:53:51,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:53:51,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875649868] [2024-11-19 00:53:51,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:51,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:53:51,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:53:51,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:53:51,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:53:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:52,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:53:52,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 95 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 00:53:53,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:53:53,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:53:53,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:53:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875649868] [2024-11-19 00:53:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875649868] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:53:53,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:53:53,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-19 00:53:53,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562833842] [2024-11-19 00:53:53,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:53,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:53:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:53:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:53:53,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:53:53,372 INFO L87 Difference]: Start difference. First operand 218 states and 320 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:53:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:53,520 INFO L93 Difference]: Finished difference Result 468 states and 686 transitions. [2024-11-19 00:53:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:53:53,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 133 [2024-11-19 00:53:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:53,524 INFO L225 Difference]: With dead ends: 468 [2024-11-19 00:53:53,524 INFO L226 Difference]: Without dead ends: 253 [2024-11-19 00:53:53,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:53:53,525 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 102 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:53,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 456 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:53:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-19 00:53:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 222. [2024-11-19 00:53:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.402116402116402) internal successors, (265), 189 states have internal predecessors, (265), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:53:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 325 transitions. [2024-11-19 00:53:53,541 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 325 transitions. Word has length 133 [2024-11-19 00:53:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:53,542 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 325 transitions. [2024-11-19 00:53:53,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:53:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 325 transitions. [2024-11-19 00:53:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:53,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:53,548 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:53:53,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 00:53:53,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:53:53,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:53,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:53,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1820585179, now seen corresponding path program 1 times [2024-11-19 00:53:53,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:53:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892780457] [2024-11-19 00:53:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:53,751 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:53:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:53:53,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:53:53,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:53:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:54,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:53:54,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:54,921 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 34 treesize of output 22 [2024-11-19 00:53:54,943 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:53:54,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:53:54,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:53:54,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892780457] [2024-11-19 00:53:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892780457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:53:54,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:53:54,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:53:54,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660726026] [2024-11-19 00:53:54,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:54,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:53:54,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:53:54,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:53:54,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:53:54,947 INFO L87 Difference]: Start difference. First operand 222 states and 325 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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:53:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:53:55,069 INFO L93 Difference]: Finished difference Result 445 states and 651 transitions. [2024-11-19 00:53:55,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:53:55,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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:53:55,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:53:55,074 INFO L225 Difference]: With dead ends: 445 [2024-11-19 00:53:55,074 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 00:53:55,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:53:55,076 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 70 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:53:55,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 456 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:53:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 00:53:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2024-11-19 00:53:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 189 states have internal predecessors, (264), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:53:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 324 transitions. [2024-11-19 00:53:55,093 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 324 transitions. Word has length 134 [2024-11-19 00:53:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:53:55,096 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 324 transitions. [2024-11-19 00:53:55,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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:53:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 324 transitions. [2024-11-19 00:53:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:53:55,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:53:55,098 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:53:55,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 00:53:55,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:53:55,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:53:55,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:53:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1119520601, now seen corresponding path program 1 times [2024-11-19 00:53:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:53:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67859050] [2024-11-19 00:53:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:53:55,300 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:53:55,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:53:55,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:53:55,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:53:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:53:55,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:53:55,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:53:56,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:53:56,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2024-11-19 00:53:56,827 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 46 treesize of output 34 [2024-11-19 00:53:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-19 00:53:56,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:53:57,412 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:53:57,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:53:57,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67859050] [2024-11-19 00:53:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67859050] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:53:57,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:53:57,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2024-11-19 00:53:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513995447] [2024-11-19 00:53:57,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:53:57,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:53:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:53:57,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:53:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:53:57,415 INFO L87 Difference]: Start difference. First operand 222 states and 324 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:54:00,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:54:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:54:00,655 INFO L93 Difference]: Finished difference Result 564 states and 818 transitions. [2024-11-19 00:54:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:54:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:54:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:54:00,681 INFO L225 Difference]: With dead ends: 564 [2024-11-19 00:54:00,681 INFO L226 Difference]: Without dead ends: 345 [2024-11-19 00:54:00,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:54:00,683 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:54:00,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 411 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 00:54:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-19 00:54:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2024-11-19 00:54:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 302 states have (on average 1.400662251655629) internal successors, (423), 304 states have internal predecessors, (423), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 00:54:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 491 transitions. [2024-11-19 00:54:00,708 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 491 transitions. Word has length 134 [2024-11-19 00:54:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:54:00,709 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 491 transitions. [2024-11-19 00:54:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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:54:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 491 transitions. [2024-11-19 00:54:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:54:00,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:54:00,711 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:54:00,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 00:54:00,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:54:00,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:54:00,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:54:00,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1937169051, now seen corresponding path program 1 times [2024-11-19 00:54:00,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:54:00,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920762464] [2024-11-19 00:54:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:54:00,914 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:54:00,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:54:00,917 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:54:00,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 00:54:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:54:01,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:54:01,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:54:02,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:54:02,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2024-11-19 00:54:02,655 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 46 treesize of output 34 [2024-11-19 00:54:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-19 00:54:02,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:54:03,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:54:03,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:54:03,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920762464] [2024-11-19 00:54:03,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920762464] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:54:03,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:54:03,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-19 00:54:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789122309] [2024-11-19 00:54:03,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:54:03,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:54:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:54:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:54:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:54:03,782 INFO L87 Difference]: Start difference. First operand 341 states and 491 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:54:07,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 00:54:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:54:08,976 INFO L93 Difference]: Finished difference Result 787 states and 1129 transitions. [2024-11-19 00:54:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:54:09,004 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:54:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:54:09,008 INFO L225 Difference]: With dead ends: 787 [2024-11-19 00:54:09,008 INFO L226 Difference]: Without dead ends: 449 [2024-11-19 00:54:09,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:54:09,009 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 73 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:54:09,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 537 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-19 00:54:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-19 00:54:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 342. [2024-11-19 00:54:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 303 states have (on average 1.396039603960396) internal successors, (423), 305 states have internal predecessors, (423), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 00:54:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 491 transitions. [2024-11-19 00:54:09,026 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 491 transitions. Word has length 134 [2024-11-19 00:54:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:54:09,026 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 491 transitions. [2024-11-19 00:54:09,026 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:54:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 491 transitions. [2024-11-19 00:54:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:54:09,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:54:09,028 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:54:09,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 00:54:09,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:54:09,229 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:54:09,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:54:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1964771235, now seen corresponding path program 1 times [2024-11-19 00:54:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:54:09,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679036814] [2024-11-19 00:54:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:54:09,230 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:54:09,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:54:09,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:54:09,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 00:54:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:54:09,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:54:09,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:54:09,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:54:09,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-19 00:54:09,931 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:54:09,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:54:09,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:54:09,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679036814] [2024-11-19 00:54:09,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679036814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:54:09,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:54:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:54:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770891992] [2024-11-19 00:54:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:54:09,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:54:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:54:09,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:54:09,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:54:09,933 INFO L87 Difference]: Start difference. First operand 342 states and 491 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:54:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:54:10,238 INFO L93 Difference]: Finished difference Result 894 states and 1285 transitions. [2024-11-19 00:54:10,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:54:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:54:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:54:10,242 INFO L225 Difference]: With dead ends: 894 [2024-11-19 00:54:10,242 INFO L226 Difference]: Without dead ends: 555 [2024-11-19 00:54:10,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:54:10,244 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:54:10,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1221 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:54:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-19 00:54:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 513. [2024-11-19 00:54:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 440 states have (on average 1.3795454545454546) internal successors, (607), 444 states have internal predecessors, (607), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:54:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 735 transitions. [2024-11-19 00:54:10,267 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 735 transitions. Word has length 134 [2024-11-19 00:54:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:54:10,268 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 735 transitions. [2024-11-19 00:54:10,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:54:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 735 transitions. [2024-11-19 00:54:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 00:54:10,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:54:10,270 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:54:10,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 00:54:10,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:54:10,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:54:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:54:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash -978971991, now seen corresponding path program 1 times [2024-11-19 00:54:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:54:10,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443639448] [2024-11-19 00:54:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:54:10,472 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:54:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:54:10,473 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:54:10,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 00:54:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:54:11,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:54:11,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:54:12,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2024-11-19 00:54:12,772 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 46 treesize of output 34 [2024-11-19 00:54:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 10 proven. 206 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-19 00:54:12,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:54:16,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:54:16,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-19 00:54:16,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:54:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443639448] [2024-11-19 00:54:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443639448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:54:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1481377314] [2024-11-19 00:54:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:54:16,773 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:54:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:54:16,775 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:54:16,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-19 00:54:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:54:18,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:54:18,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:54:18,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:54:18,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-19 00:54:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-19 00:54:18,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:54:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1481377314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:54:18,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:54:18,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-19 00:54:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818250768] [2024-11-19 00:54:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:54:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:54:18,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:54:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:54:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:54:18,969 INFO L87 Difference]: Start difference. First operand 513 states and 735 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)