./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.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-a_file-15.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 af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:32:15,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:32:16,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:32:16,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:32:16,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:32:16,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:32:16,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:32:16,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:32:16,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:32:16,120 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:32:16,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:32:16,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:32:16,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:32:16,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:32:16,122 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:32:16,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:32:16,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:32:16,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:32:16,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:32:16,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:32:16,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:32:16,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:32:16,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:32:16,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:32:16,130 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:32:16,130 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:32:16,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:32:16,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:32:16,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:32:16,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:32:16,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:32:16,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:32:16,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:32:16,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:32:16,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:32:16,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:32:16,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:32:16,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:32:16,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:32:16,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:32:16,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:32:16,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:32:16,137 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 -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2024-11-19 00:32:16,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:32:16,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:32:16,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:32:16,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:32:16,443 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:32:16,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2024-11-19 00:32:17,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:32:18,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:32:18,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2024-11-19 00:32:18,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b2e5bc0/2ddbabcd53394e418b03b775d056a782/FLAGc9db0faca [2024-11-19 00:32:18,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b2e5bc0/2ddbabcd53394e418b03b775d056a782 [2024-11-19 00:32:18,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:32:18,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:32:18,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:32:18,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:32:18,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:32:18,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1875fcc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18, skipping insertion in model container [2024-11-19 00:32:18,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:32:18,435 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-a_file-15.i[916,929] [2024-11-19 00:32:18,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:32:18,515 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:32:18,525 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-a_file-15.i[916,929] [2024-11-19 00:32:18,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:32:18,618 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:32:18,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18 WrapperNode [2024-11-19 00:32:18,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:32:18,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:32:18,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:32:18,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:32:18,627 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:32:18" (1/1) ... [2024-11-19 00:32:18,644 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:32:18" (1/1) ... [2024-11-19 00:32:18,705 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-11-19 00:32:18,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:32:18,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:32:18,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:32:18,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:32:18,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,770 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-11-19 00:32:18,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:32:18,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:32:18,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:32:18,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:32:18,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (1/1) ... [2024-11-19 00:32:18,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:32:18,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:32:18,876 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:32:18,881 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:32:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:32:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:32:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:32:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:32:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:32:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:32:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:32:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:32:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:32:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:32:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:32:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:32:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:32:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:32:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:32:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:32:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:32:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:32:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:32:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:32:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:32:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:32:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:32:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:32:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:32:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:32:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:32:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:32:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:32:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:32:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:32:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:32:18,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:32:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:32:18,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:32:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:32:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:32:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:32:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:32:18,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:32:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:32:19,107 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:32:19,109 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:32:19,665 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-19 00:32:19,665 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:32:19,686 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:32:19,686 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:32:19,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:19 BoogieIcfgContainer [2024-11-19 00:32:19,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:32:19,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:32:19,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:32:19,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:32:19,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:32:18" (1/3) ... [2024-11-19 00:32:19,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c322840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:32:19, skipping insertion in model container [2024-11-19 00:32:19,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:32:18" (2/3) ... [2024-11-19 00:32:19,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c322840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:32:19, skipping insertion in model container [2024-11-19 00:32:19,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:19" (3/3) ... [2024-11-19 00:32:19,697 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2024-11-19 00:32:19,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:32:19,711 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:32:19,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:32:19,785 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;@76ced30b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:32:19,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:32:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:32:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:32:19,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:19,807 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:19,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:19,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash 31279224, now seen corresponding path program 1 times [2024-11-19 00:32:19,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:19,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379989650] [2024-11-19 00:32:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 00:32:20,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:20,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379989650] [2024-11-19 00:32:20,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379989650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:32:20,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023972493] [2024-11-19 00:32:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:20,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:32:20,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:32:20,203 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:32:20,204 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:32:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:20,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:32:20,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:32:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 00:32:20,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:32:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023972493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:20,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:32:20,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:32:20,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188298510] [2024-11-19 00:32:20,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:20,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:32:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:32:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:32:20,629 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:20,663 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-19 00:32:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:32:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-19 00:32:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:20,675 INFO L225 Difference]: With dead ends: 219 [2024-11-19 00:32:20,676 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 00:32:20,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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:32:20,684 INFO L432 NwaCegarLoop]: 157 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, 157 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:32:20,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:32:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 00:32:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-19 00:32:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:32:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-19 00:32:20,748 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-19 00:32:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:20,749 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-19 00:32:20,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-19 00:32:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:32:20,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:20,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:20,776 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:32:20,958 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:32:20,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:20,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1829017178, now seen corresponding path program 1 times [2024-11-19 00:32:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:20,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104278503] [2024-11-19 00:32:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:21,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104278503] [2024-11-19 00:32:21,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104278503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:21,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:21,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:32:21,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965153243] [2024-11-19 00:32:21,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:21,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:32:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:21,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:32:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:32:21,302 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:21,362 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-19 00:32:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:32:21,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-19 00:32:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:21,365 INFO L225 Difference]: With dead ends: 217 [2024-11-19 00:32:21,367 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:32:21,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:32:21,370 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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:32:21,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:32:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:32:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 00:32:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:32:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-19 00:32:21,387 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-19 00:32:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:21,388 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-19 00:32:21,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-19 00:32:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:32:21,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:21,397 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:32:21,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:21,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1512009960, now seen corresponding path program 1 times [2024-11-19 00:32:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547724543] [2024-11-19 00:32:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:21,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547724543] [2024-11-19 00:32:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547724543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:21,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:21,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:32:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293303546] [2024-11-19 00:32:21,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:32:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:21,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:32:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:32:21,550 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:21,577 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-11-19 00:32:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:32:21,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-19 00:32:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:21,583 INFO L225 Difference]: With dead ends: 220 [2024-11-19 00:32:21,583 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 00:32:21,584 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:32:21,585 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:21,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:32:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 00:32:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 00:32:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:32:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-19 00:32:21,596 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 115 [2024-11-19 00:32:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:21,596 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-19 00:32:21,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-19 00:32:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:32:21,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:21,601 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:21,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:32:21,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:21,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:21,602 INFO L85 PathProgramCache]: Analyzing trace with hash -176933782, now seen corresponding path program 1 times [2024-11-19 00:32:21,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:21,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189818618] [2024-11-19 00:32:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:21,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189818618] [2024-11-19 00:32:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189818618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:32:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039246001] [2024-11-19 00:32:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:32:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:21,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:32:21,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:32:21,765 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:21,796 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-19 00:32:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:32:21,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-19 00:32:21,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:21,798 INFO L225 Difference]: With dead ends: 222 [2024-11-19 00:32:21,799 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 00:32:21,799 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:32:21,800 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:21,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:32:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 00:32:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-19 00:32:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:32:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-19 00:32:21,809 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-11-19 00:32:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:21,810 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-19 00:32:21,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-19 00:32:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:32:21,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:21,813 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:32:21,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:21,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:21,814 INFO L85 PathProgramCache]: Analyzing trace with hash 81231656, now seen corresponding path program 1 times [2024-11-19 00:32:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:21,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672388030] [2024-11-19 00:32:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:21,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:22,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672388030] [2024-11-19 00:32:22,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672388030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:22,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:22,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:32:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828486170] [2024-11-19 00:32:22,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:22,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:32:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:22,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:32:22,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:32:22,197 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:22,447 INFO L93 Difference]: Finished difference Result 443 states and 635 transitions. [2024-11-19 00:32:22,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:32:22,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-19 00:32:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:22,452 INFO L225 Difference]: With dead ends: 443 [2024-11-19 00:32:22,453 INFO L226 Difference]: Without dead ends: 333 [2024-11-19 00:32:22,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:32:22,458 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 372 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:22,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 779 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:32:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-19 00:32:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2024-11-19 00:32:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 191 states have (on average 1.387434554973822) internal successors, (265), 191 states have internal predecessors, (265), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:32:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 313 transitions. [2024-11-19 00:32:22,491 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 313 transitions. Word has length 115 [2024-11-19 00:32:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:22,492 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 313 transitions. [2024-11-19 00:32:22,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 313 transitions. [2024-11-19 00:32:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:32:22,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:22,494 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:22,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:32:22,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:22,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2143462140, now seen corresponding path program 1 times [2024-11-19 00:32:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:22,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472937111] [2024-11-19 00:32:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:22,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472937111] [2024-11-19 00:32:22,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472937111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:22,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:22,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:32:22,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419538994] [2024-11-19 00:32:22,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:22,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:32:22,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:22,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:32:22,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:32:22,679 INFO L87 Difference]: Start difference. First operand 218 states and 313 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:22,736 INFO L93 Difference]: Finished difference Result 437 states and 627 transitions. [2024-11-19 00:32:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:32:22,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-19 00:32:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:22,741 INFO L225 Difference]: With dead ends: 437 [2024-11-19 00:32:22,741 INFO L226 Difference]: Without dead ends: 222 [2024-11-19 00:32:22,742 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:32:22,742 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 106 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:22,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 516 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:32:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-19 00:32:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2024-11-19 00:32:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 190 states have (on average 1.3842105263157896) internal successors, (263), 190 states have internal predecessors, (263), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:32:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 311 transitions. [2024-11-19 00:32:22,772 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 311 transitions. Word has length 117 [2024-11-19 00:32:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:22,772 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 311 transitions. [2024-11-19 00:32:22,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 311 transitions. [2024-11-19 00:32:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 00:32:22,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:22,774 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:22,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:32:22,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:22,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash 635553891, now seen corresponding path program 1 times [2024-11-19 00:32:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575097189] [2024-11-19 00:32:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575097189] [2024-11-19 00:32:23,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575097189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:23,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:32:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339297074] [2024-11-19 00:32:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:23,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:32:23,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:23,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:32:23,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:32:23,431 INFO L87 Difference]: Start difference. First operand 217 states and 311 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:23,595 INFO L93 Difference]: Finished difference Result 498 states and 713 transitions. [2024-11-19 00:32:23,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:32:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-19 00:32:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:23,598 INFO L225 Difference]: With dead ends: 498 [2024-11-19 00:32:23,599 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 00:32:23,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:32:23,601 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 114 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:23,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1618 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 00:32:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2024-11-19 00:32:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 339 states have (on average 1.3893805309734513) internal successors, (471), 341 states have internal predecessors, (471), 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:32:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 551 transitions. [2024-11-19 00:32:23,628 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 551 transitions. Word has length 117 [2024-11-19 00:32:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:23,629 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 551 transitions. [2024-11-19 00:32:23,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 551 transitions. [2024-11-19 00:32:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:32:23,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:23,632 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:23,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:32:23,632 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:23,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:23,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1552103804, now seen corresponding path program 1 times [2024-11-19 00:32:23,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428695935] [2024-11-19 00:32:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428695935] [2024-11-19 00:32:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428695935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:24,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:24,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:32:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773393051] [2024-11-19 00:32:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:24,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:32:24,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:32:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:24,013 INFO L87 Difference]: Start difference. First operand 384 states and 551 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:24,182 INFO L93 Difference]: Finished difference Result 985 states and 1415 transitions. [2024-11-19 00:32:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:32:24,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-19 00:32:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:24,189 INFO L225 Difference]: With dead ends: 985 [2024-11-19 00:32:24,191 INFO L226 Difference]: Without dead ends: 604 [2024-11-19 00:32:24,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:32:24,192 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 146 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:24,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1343 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-19 00:32:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2024-11-19 00:32:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 531 states have (on average 1.3860640301318268) internal successors, (736), 533 states have internal predecessors, (736), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 864 transitions. [2024-11-19 00:32:24,234 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 864 transitions. Word has length 118 [2024-11-19 00:32:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:24,235 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 864 transitions. [2024-11-19 00:32:24,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 864 transitions. [2024-11-19 00:32:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:32:24,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:24,237 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:24,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:32:24,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:24,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1309316045, now seen corresponding path program 1 times [2024-11-19 00:32:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:24,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741979713] [2024-11-19 00:32:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:24,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:24,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741979713] [2024-11-19 00:32:24,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741979713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:24,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:24,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:32:24,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182581736] [2024-11-19 00:32:24,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:24,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:32:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:24,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:32:24,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:32:24,717 INFO L87 Difference]: Start difference. First operand 602 states and 864 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:24,844 INFO L93 Difference]: Finished difference Result 1540 states and 2191 transitions. [2024-11-19 00:32:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:32:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-11-19 00:32:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:24,850 INFO L225 Difference]: With dead ends: 1540 [2024-11-19 00:32:24,852 INFO L226 Difference]: Without dead ends: 941 [2024-11-19 00:32:24,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:24,854 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 71 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:24,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 830 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-19 00:32:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 930. [2024-11-19 00:32:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 841 states have (on average 1.3816884661117717) internal successors, (1162), 849 states have internal predecessors, (1162), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-19 00:32:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1314 transitions. [2024-11-19 00:32:24,905 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1314 transitions. Word has length 118 [2024-11-19 00:32:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:24,906 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1314 transitions. [2024-11-19 00:32:24,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1314 transitions. [2024-11-19 00:32:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 00:32:24,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:24,908 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:24,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:32:24,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:24,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1732196226, now seen corresponding path program 1 times [2024-11-19 00:32:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690992942] [2024-11-19 00:32:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:24,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690992942] [2024-11-19 00:32:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690992942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:25,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:25,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:32:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342929173] [2024-11-19 00:32:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:25,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:32:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:25,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:32:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:32:25,310 INFO L87 Difference]: Start difference. First operand 930 states and 1314 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:25,438 INFO L93 Difference]: Finished difference Result 1431 states and 2003 transitions. [2024-11-19 00:32:25,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:32:25,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-11-19 00:32:25,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:25,445 INFO L225 Difference]: With dead ends: 1431 [2024-11-19 00:32:25,445 INFO L226 Difference]: Without dead ends: 958 [2024-11-19 00:32:25,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:25,447 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 79 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:25,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 911 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-11-19 00:32:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 704. [2024-11-19 00:32:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 627 states have (on average 1.3779904306220097) internal successors, (864), 629 states have internal predecessors, (864), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 992 transitions. [2024-11-19 00:32:25,493 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 992 transitions. Word has length 118 [2024-11-19 00:32:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:25,493 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 992 transitions. [2024-11-19 00:32:25,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 992 transitions. [2024-11-19 00:32:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 00:32:25,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:25,496 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:25,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:32:25,497 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:25,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -364021403, now seen corresponding path program 1 times [2024-11-19 00:32:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:25,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204583379] [2024-11-19 00:32:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:26,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204583379] [2024-11-19 00:32:26,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204583379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:26,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:26,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:32:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38776117] [2024-11-19 00:32:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:26,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:32:26,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:26,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:32:26,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:26,055 INFO L87 Difference]: Start difference. First operand 704 states and 992 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:26,507 INFO L93 Difference]: Finished difference Result 1584 states and 2228 transitions. [2024-11-19 00:32:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:32:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-19 00:32:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:26,516 INFO L225 Difference]: With dead ends: 1584 [2024-11-19 00:32:26,517 INFO L226 Difference]: Without dead ends: 883 [2024-11-19 00:32:26,519 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:32:26,520 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 213 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:26,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1336 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:32:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-19 00:32:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 722. [2024-11-19 00:32:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 645 states have (on average 1.3751937984496123) internal successors, (887), 647 states have internal predecessors, (887), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1015 transitions. [2024-11-19 00:32:26,592 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1015 transitions. Word has length 119 [2024-11-19 00:32:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:26,593 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1015 transitions. [2024-11-19 00:32:26,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1015 transitions. [2024-11-19 00:32:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 00:32:26,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:26,595 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:26,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:32:26,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:26,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2023782025, now seen corresponding path program 1 times [2024-11-19 00:32:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:26,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464233005] [2024-11-19 00:32:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:26,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:26,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464233005] [2024-11-19 00:32:26,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464233005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:26,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:26,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:32:26,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255296429] [2024-11-19 00:32:26,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:26,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:32:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:26,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:32:26,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:32:26,924 INFO L87 Difference]: Start difference. First operand 722 states and 1015 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:27,066 INFO L93 Difference]: Finished difference Result 1697 states and 2362 transitions. [2024-11-19 00:32:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:32:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-19 00:32:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:27,072 INFO L225 Difference]: With dead ends: 1697 [2024-11-19 00:32:27,073 INFO L226 Difference]: Without dead ends: 978 [2024-11-19 00:32:27,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:27,077 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 77 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:27,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 681 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-19 00:32:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 720. [2024-11-19 00:32:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 643 states have (on average 1.3670295489891136) internal successors, (879), 645 states have internal predecessors, (879), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1007 transitions. [2024-11-19 00:32:27,138 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1007 transitions. Word has length 119 [2024-11-19 00:32:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:27,139 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1007 transitions. [2024-11-19 00:32:27,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1007 transitions. [2024-11-19 00:32:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 00:32:27,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:27,141 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:27,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:32:27,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:27,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash -754090431, now seen corresponding path program 1 times [2024-11-19 00:32:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:27,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607762562] [2024-11-19 00:32:27,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:27,427 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607762562] [2024-11-19 00:32:27,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607762562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:27,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:27,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:32:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031792762] [2024-11-19 00:32:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:27,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:32:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:32:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:32:27,429 INFO L87 Difference]: Start difference. First operand 720 states and 1007 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:27,568 INFO L93 Difference]: Finished difference Result 1533 states and 2133 transitions. [2024-11-19 00:32:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:32:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-19 00:32:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:27,572 INFO L225 Difference]: With dead ends: 1533 [2024-11-19 00:32:27,573 INFO L226 Difference]: Without dead ends: 816 [2024-11-19 00:32:27,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:27,575 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 79 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:27,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 926 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-19 00:32:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 670. [2024-11-19 00:32:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 593 states have (on average 1.3642495784148398) internal successors, (809), 595 states have internal predecessors, (809), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 937 transitions. [2024-11-19 00:32:27,620 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 937 transitions. Word has length 120 [2024-11-19 00:32:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:27,621 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 937 transitions. [2024-11-19 00:32:27,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 937 transitions. [2024-11-19 00:32:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 00:32:27,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:27,622 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:27,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:32:27,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:27,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1906837686, now seen corresponding path program 1 times [2024-11-19 00:32:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962330879] [2024-11-19 00:32:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962330879] [2024-11-19 00:32:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962330879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:32:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555197127] [2024-11-19 00:32:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:27,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:32:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:32:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:32:27,961 INFO L87 Difference]: Start difference. First operand 670 states and 937 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:28,094 INFO L93 Difference]: Finished difference Result 1473 states and 2049 transitions. [2024-11-19 00:32:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:32:28,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-19 00:32:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:28,099 INFO L225 Difference]: With dead ends: 1473 [2024-11-19 00:32:28,099 INFO L226 Difference]: Without dead ends: 806 [2024-11-19 00:32:28,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:28,101 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 76 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:28,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 714 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-19 00:32:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 668. [2024-11-19 00:32:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 591 states have (on average 1.3587140439932317) internal successors, (803), 593 states have internal predecessors, (803), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 931 transitions. [2024-11-19 00:32:28,149 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 931 transitions. Word has length 120 [2024-11-19 00:32:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:28,149 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 931 transitions. [2024-11-19 00:32:28,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 931 transitions. [2024-11-19 00:32:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 00:32:28,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:28,151 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:28,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:32:28,152 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:28,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1772824180, now seen corresponding path program 1 times [2024-11-19 00:32:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:28,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691064618] [2024-11-19 00:32:28,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:28,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691064618] [2024-11-19 00:32:28,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691064618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:28,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:32:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997276018] [2024-11-19 00:32:28,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:28,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:32:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:32:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:32:28,521 INFO L87 Difference]: Start difference. First operand 668 states and 931 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:28,643 INFO L93 Difference]: Finished difference Result 1468 states and 2036 transitions. [2024-11-19 00:32:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:32:28,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-19 00:32:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:28,648 INFO L225 Difference]: With dead ends: 1468 [2024-11-19 00:32:28,648 INFO L226 Difference]: Without dead ends: 803 [2024-11-19 00:32:28,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:28,650 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 130 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:28,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 581 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-11-19 00:32:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 668. [2024-11-19 00:32:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 591 states have (on average 1.3468697123519457) internal successors, (796), 593 states have internal predecessors, (796), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 924 transitions. [2024-11-19 00:32:28,689 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 924 transitions. Word has length 120 [2024-11-19 00:32:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:28,689 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 924 transitions. [2024-11-19 00:32:28,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 924 transitions. [2024-11-19 00:32:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 00:32:28,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:28,691 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:28,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:32:28,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash 751755826, now seen corresponding path program 1 times [2024-11-19 00:32:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:28,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699812152] [2024-11-19 00:32:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:28,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:29,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:29,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699812152] [2024-11-19 00:32:29,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699812152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:29,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:29,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:32:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951965377] [2024-11-19 00:32:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:29,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:32:29,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:32:29,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:29,069 INFO L87 Difference]: Start difference. First operand 668 states and 924 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:29,421 INFO L93 Difference]: Finished difference Result 1495 states and 2058 transitions. [2024-11-19 00:32:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:32:29,421 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-19 00:32:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:29,425 INFO L225 Difference]: With dead ends: 1495 [2024-11-19 00:32:29,425 INFO L226 Difference]: Without dead ends: 798 [2024-11-19 00:32:29,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:32:29,427 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 246 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:29,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1046 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:32:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-11-19 00:32:29,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 685. [2024-11-19 00:32:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 608 states have (on average 1.3421052631578947) internal successors, (816), 610 states have internal predecessors, (816), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 944 transitions. [2024-11-19 00:32:29,469 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 944 transitions. Word has length 120 [2024-11-19 00:32:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:29,469 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 944 transitions. [2024-11-19 00:32:29,470 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 944 transitions. [2024-11-19 00:32:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 00:32:29,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:29,471 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:29,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:32:29,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:29,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:29,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2137959220, now seen corresponding path program 1 times [2024-11-19 00:32:29,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:29,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225012494] [2024-11-19 00:32:29,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:29,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225012494] [2024-11-19 00:32:29,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225012494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:29,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:29,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:32:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033727586] [2024-11-19 00:32:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:29,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:32:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:32:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:32:29,977 INFO L87 Difference]: Start difference. First operand 685 states and 944 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:30,419 INFO L93 Difference]: Finished difference Result 1532 states and 2108 transitions. [2024-11-19 00:32:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:32:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-19 00:32:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:30,424 INFO L225 Difference]: With dead ends: 1532 [2024-11-19 00:32:30,424 INFO L226 Difference]: Without dead ends: 850 [2024-11-19 00:32:30,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:32:30,427 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 255 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:30,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1177 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:32:30,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-19 00:32:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 675. [2024-11-19 00:32:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 598 states have (on average 1.3411371237458194) internal successors, (802), 600 states have internal predecessors, (802), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 930 transitions. [2024-11-19 00:32:30,474 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 930 transitions. Word has length 120 [2024-11-19 00:32:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:30,475 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 930 transitions. [2024-11-19 00:32:30,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 930 transitions. [2024-11-19 00:32:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:32:30,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:30,479 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:30,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 00:32:30,480 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:30,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2118823200, now seen corresponding path program 1 times [2024-11-19 00:32:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:30,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774591732] [2024-11-19 00:32:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:36,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:36,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774591732] [2024-11-19 00:32:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774591732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:36,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 00:32:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472910800] [2024-11-19 00:32:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:36,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:32:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:36,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:32:36,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=199, Unknown=1, NotChecked=0, Total=240 [2024-11-19 00:32:36,080 INFO L87 Difference]: Start difference. First operand 675 states and 930 transitions. Second operand has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-19 00:32:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:51,599 INFO L93 Difference]: Finished difference Result 1551 states and 2138 transitions. [2024-11-19 00:32:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 00:32:51,600 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 121 [2024-11-19 00:32:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:51,605 INFO L225 Difference]: With dead ends: 1551 [2024-11-19 00:32:51,605 INFO L226 Difference]: Without dead ends: 1197 [2024-11-19 00:32:51,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=142, Invalid=727, Unknown=1, NotChecked=0, Total=870 [2024-11-19 00:32:51,607 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 945 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:51,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 3521 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 00:32:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-11-19 00:32:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 717. [2024-11-19 00:32:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 640 states have (on average 1.3390625) internal successors, (857), 642 states have internal predecessors, (857), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 985 transitions. [2024-11-19 00:32:51,663 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 985 transitions. Word has length 121 [2024-11-19 00:32:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:51,664 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 985 transitions. [2024-11-19 00:32:51,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-19 00:32:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 985 transitions. [2024-11-19 00:32:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:32:51,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:51,666 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:51,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:32:51,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:51,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2114104482, now seen corresponding path program 1 times [2024-11-19 00:32:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:51,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013779908] [2024-11-19 00:32:51,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:52,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:52,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013779908] [2024-11-19 00:32:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013779908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:32:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656263961] [2024-11-19 00:32:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:52,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:32:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:32:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:32:52,624 INFO L87 Difference]: Start difference. First operand 717 states and 985 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 00:32:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:54,144 INFO L93 Difference]: Finished difference Result 1491 states and 2055 transitions. [2024-11-19 00:32:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:32:54,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 121 [2024-11-19 00:32:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:54,151 INFO L225 Difference]: With dead ends: 1491 [2024-11-19 00:32:54,151 INFO L226 Difference]: Without dead ends: 1095 [2024-11-19 00:32:54,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:32:54,154 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 357 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:54,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 2386 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 00:32:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-19 00:32:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 687. [2024-11-19 00:32:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 610 states have (on average 1.339344262295082) internal successors, (817), 612 states have internal predecessors, (817), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 945 transitions. [2024-11-19 00:32:54,210 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 945 transitions. Word has length 121 [2024-11-19 00:32:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:54,211 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 945 transitions. [2024-11-19 00:32:54,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 00:32:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 945 transitions. [2024-11-19 00:32:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:32:54,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:54,213 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:54,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:32:54,213 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:54,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:54,214 INFO L85 PathProgramCache]: Analyzing trace with hash 417061139, now seen corresponding path program 1 times [2024-11-19 00:32:54,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:54,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422051009] [2024-11-19 00:32:54,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:54,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:54,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422051009] [2024-11-19 00:32:54,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422051009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:54,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:54,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:32:54,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330587945] [2024-11-19 00:32:54,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:54,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:32:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:32:54,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:32:54,629 INFO L87 Difference]: Start difference. First operand 687 states and 945 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:54,850 INFO L93 Difference]: Finished difference Result 1394 states and 1914 transitions. [2024-11-19 00:32:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:32:54,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-19 00:32:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:54,854 INFO L225 Difference]: With dead ends: 1394 [2024-11-19 00:32:54,854 INFO L226 Difference]: Without dead ends: 710 [2024-11-19 00:32:54,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:32:54,857 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 113 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:54,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 2140 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-19 00:32:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698. [2024-11-19 00:32:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 621 states have (on average 1.3317230273752012) internal successors, (827), 623 states have internal predecessors, (827), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 955 transitions. [2024-11-19 00:32:54,910 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 955 transitions. Word has length 121 [2024-11-19 00:32:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:54,910 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 955 transitions. [2024-11-19 00:32:54,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:32:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 955 transitions. [2024-11-19 00:32:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 00:32:54,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:54,912 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:54,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 00:32:54,914 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:54,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash 635915857, now seen corresponding path program 1 times [2024-11-19 00:32:54,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:54,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783929441] [2024-11-19 00:32:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:55,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:55,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783929441] [2024-11-19 00:32:55,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783929441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:55,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:55,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:32:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736502999] [2024-11-19 00:32:55,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:55,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:32:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:32:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:32:55,320 INFO L87 Difference]: Start difference. First operand 698 states and 955 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:55,448 INFO L93 Difference]: Finished difference Result 1458 states and 1996 transitions. [2024-11-19 00:32:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:32:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-19 00:32:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:55,452 INFO L225 Difference]: With dead ends: 1458 [2024-11-19 00:32:55,453 INFO L226 Difference]: Without dead ends: 763 [2024-11-19 00:32:55,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:32:55,455 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 53 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:55,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 924 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:32:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-19 00:32:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 700. [2024-11-19 00:32:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 623 states have (on average 1.3306581059390048) internal successors, (829), 625 states have internal predecessors, (829), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 957 transitions. [2024-11-19 00:32:55,516 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 957 transitions. Word has length 121 [2024-11-19 00:32:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:55,516 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 957 transitions. [2024-11-19 00:32:55,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:32:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 957 transitions. [2024-11-19 00:32:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:32:55,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:55,517 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:55,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:32:55,518 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:55,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1095319066, now seen corresponding path program 1 times [2024-11-19 00:32:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639810087] [2024-11-19 00:32:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:32:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:32:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:32:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639810087] [2024-11-19 00:32:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639810087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:32:56,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:32:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-19 00:32:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403692495] [2024-11-19 00:32:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:32:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:32:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:32:56,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:32:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:32:56,912 INFO L87 Difference]: Start difference. First operand 700 states and 957 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-19 00:32:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:32:59,501 INFO L93 Difference]: Finished difference Result 1599 states and 2180 transitions. [2024-11-19 00:32:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 00:32:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2024-11-19 00:32:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:32:59,508 INFO L225 Difference]: With dead ends: 1599 [2024-11-19 00:32:59,508 INFO L226 Difference]: Without dead ends: 1217 [2024-11-19 00:32:59,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2024-11-19 00:32:59,511 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 1036 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:32:59,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 2500 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:32:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-19 00:32:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 720. [2024-11-19 00:32:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 643 states have (on average 1.328149300155521) internal successors, (854), 645 states have internal predecessors, (854), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:32:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 982 transitions. [2024-11-19 00:32:59,581 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 982 transitions. Word has length 122 [2024-11-19 00:32:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:32:59,581 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 982 transitions. [2024-11-19 00:32:59,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-19 00:32:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 982 transitions. [2024-11-19 00:32:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:32:59,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:32:59,585 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:59,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:32:59,586 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:32:59,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:32:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash 827908968, now seen corresponding path program 1 times [2024-11-19 00:32:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:32:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250808101] [2024-11-19 00:32:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:32:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:32:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:00,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:00,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250808101] [2024-11-19 00:33:00,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250808101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:00,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:00,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:33:00,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687065525] [2024-11-19 00:33:00,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:00,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:33:00,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:33:00,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:33:00,443 INFO L87 Difference]: Start difference. First operand 720 states and 982 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 00:33:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:02,689 INFO L93 Difference]: Finished difference Result 1569 states and 2145 transitions. [2024-11-19 00:33:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:33:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-11-19 00:33:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:02,695 INFO L225 Difference]: With dead ends: 1569 [2024-11-19 00:33:02,695 INFO L226 Difference]: Without dead ends: 1167 [2024-11-19 00:33:02,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:33:02,696 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 504 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:02,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1720 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:33:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-19 00:33:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 701. [2024-11-19 00:33:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 624 states have (on average 1.330128205128205) internal successors, (830), 626 states have internal predecessors, (830), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:33:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 958 transitions. [2024-11-19 00:33:02,774 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 958 transitions. Word has length 122 [2024-11-19 00:33:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:02,774 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 958 transitions. [2024-11-19 00:33:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 00:33:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 958 transitions. [2024-11-19 00:33:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:33:02,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:02,776 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:02,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 00:33:02,776 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:02,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -641394042, now seen corresponding path program 1 times [2024-11-19 00:33:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521367336] [2024-11-19 00:33:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521367336] [2024-11-19 00:33:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521367336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:03,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:03,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:33:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399419875] [2024-11-19 00:33:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:03,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:03,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:03,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:03,049 INFO L87 Difference]: Start difference. First operand 701 states and 958 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:03,193 INFO L93 Difference]: Finished difference Result 1516 states and 2064 transitions. [2024-11-19 00:33:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:33:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-19 00:33:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:03,213 INFO L225 Difference]: With dead ends: 1516 [2024-11-19 00:33:03,214 INFO L226 Difference]: Without dead ends: 818 [2024-11-19 00:33:03,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:03,216 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 112 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:03,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 582 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-19 00:33:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 713. [2024-11-19 00:33:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 636 states have (on average 1.320754716981132) internal successors, (840), 638 states have internal predecessors, (840), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:33:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 968 transitions. [2024-11-19 00:33:03,290 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 968 transitions. Word has length 122 [2024-11-19 00:33:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:03,291 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 968 transitions. [2024-11-19 00:33:03,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 968 transitions. [2024-11-19 00:33:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:33:03,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:03,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:03,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 00:33:03,294 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:03,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash -240964163, now seen corresponding path program 1 times [2024-11-19 00:33:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103485080] [2024-11-19 00:33:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103485080] [2024-11-19 00:33:03,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103485080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:33:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74991681] [2024-11-19 00:33:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:03,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:33:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:33:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:33:03,908 INFO L87 Difference]: Start difference. First operand 713 states and 968 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:04,325 INFO L93 Difference]: Finished difference Result 1578 states and 2140 transitions. [2024-11-19 00:33:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:33:04,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-19 00:33:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:04,330 INFO L225 Difference]: With dead ends: 1578 [2024-11-19 00:33:04,330 INFO L226 Difference]: Without dead ends: 868 [2024-11-19 00:33:04,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:33:04,333 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 484 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:04,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 861 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:33:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-11-19 00:33:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 850. [2024-11-19 00:33:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 749 states have (on average 1.3190921228304406) internal successors, (988), 753 states have internal predecessors, (988), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 00:33:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1156 transitions. [2024-11-19 00:33:04,428 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1156 transitions. Word has length 122 [2024-11-19 00:33:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:04,428 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1156 transitions. [2024-11-19 00:33:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1156 transitions. [2024-11-19 00:33:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:33:04,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:04,431 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:04,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 00:33:04,431 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:04,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash -942028741, now seen corresponding path program 1 times [2024-11-19 00:33:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:04,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658215571] [2024-11-19 00:33:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658215571] [2024-11-19 00:33:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658215571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:05,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:33:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632040294] [2024-11-19 00:33:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:05,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:33:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:05,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:33:05,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:33:05,109 INFO L87 Difference]: Start difference. First operand 850 states and 1156 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:33:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:05,693 INFO L93 Difference]: Finished difference Result 1678 states and 2273 transitions. [2024-11-19 00:33:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:33:05,693 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-19 00:33:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:05,699 INFO L225 Difference]: With dead ends: 1678 [2024-11-19 00:33:05,699 INFO L226 Difference]: Without dead ends: 882 [2024-11-19 00:33:05,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:33:05,702 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 246 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:05,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 2610 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:33:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-19 00:33:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 858. [2024-11-19 00:33:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 754 states have (on average 1.3156498673740054) internal successors, (992), 758 states have internal predecessors, (992), 86 states have call successors, (86), 17 states have call predecessors, (86), 17 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-19 00:33:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1164 transitions. [2024-11-19 00:33:05,809 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1164 transitions. Word has length 122 [2024-11-19 00:33:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:05,809 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1164 transitions. [2024-11-19 00:33:05,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:33:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1164 transitions. [2024-11-19 00:33:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 00:33:05,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:05,811 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:05,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 00:33:05,812 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:05,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash 460635711, now seen corresponding path program 1 times [2024-11-19 00:33:05,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:05,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292356334] [2024-11-19 00:33:05,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:07,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292356334] [2024-11-19 00:33:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292356334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:07,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:07,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 00:33:07,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925659262] [2024-11-19 00:33:07,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:07,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:33:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:07,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:33:07,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:33:07,127 INFO L87 Difference]: Start difference. First operand 858 states and 1164 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:08,142 INFO L93 Difference]: Finished difference Result 1687 states and 2277 transitions. [2024-11-19 00:33:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:33:08,143 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-19 00:33:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:08,149 INFO L225 Difference]: With dead ends: 1687 [2024-11-19 00:33:08,149 INFO L226 Difference]: Without dead ends: 883 [2024-11-19 00:33:08,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:33:08,152 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 393 mSDsluCounter, 2507 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:08,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 2773 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:33:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-19 00:33:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 736. [2024-11-19 00:33:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 657 states have (on average 1.3059360730593608) internal successors, (858), 659 states have internal predecessors, (858), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:33:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 986 transitions. [2024-11-19 00:33:08,234 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 986 transitions. Word has length 122 [2024-11-19 00:33:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:08,235 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 986 transitions. [2024-11-19 00:33:08,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 986 transitions. [2024-11-19 00:33:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 00:33:08,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:08,237 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:08,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 00:33:08,237 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:08,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:08,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1858872006, now seen corresponding path program 1 times [2024-11-19 00:33:08,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:08,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824799127] [2024-11-19 00:33:08,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:08,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824799127] [2024-11-19 00:33:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824799127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:09,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 00:33:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889598921] [2024-11-19 00:33:09,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:09,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:33:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:33:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:33:09,051 INFO L87 Difference]: Start difference. First operand 736 states and 986 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:09,408 INFO L93 Difference]: Finished difference Result 1214 states and 1638 transitions. [2024-11-19 00:33:09,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:33:09,409 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2024-11-19 00:33:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:09,413 INFO L225 Difference]: With dead ends: 1214 [2024-11-19 00:33:09,413 INFO L226 Difference]: Without dead ends: 813 [2024-11-19 00:33:09,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-19 00:33:09,415 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 52 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:09,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 2156 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:33:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-19 00:33:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 745. [2024-11-19 00:33:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 666 states have (on average 1.3018018018018018) internal successors, (867), 668 states have internal predecessors, (867), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:33:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 995 transitions. [2024-11-19 00:33:09,520 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 995 transitions. Word has length 124 [2024-11-19 00:33:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:09,520 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 995 transitions. [2024-11-19 00:33:09,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 995 transitions. [2024-11-19 00:33:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 00:33:09,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:09,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:09,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 00:33:09,524 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:09,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:09,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1458442127, now seen corresponding path program 1 times [2024-11-19 00:33:09,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:09,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17318693] [2024-11-19 00:33:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17318693] [2024-11-19 00:33:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17318693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:09,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:09,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:33:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143834319] [2024-11-19 00:33:09,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:09,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:09,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:09,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:09,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:09,801 INFO L87 Difference]: Start difference. First operand 745 states and 995 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:09,973 INFO L93 Difference]: Finished difference Result 1245 states and 1664 transitions. [2024-11-19 00:33:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:33:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2024-11-19 00:33:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:09,978 INFO L225 Difference]: With dead ends: 1245 [2024-11-19 00:33:09,978 INFO L226 Difference]: Without dead ends: 835 [2024-11-19 00:33:09,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:09,980 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 55 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:09,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 873 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-11-19 00:33:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 745. [2024-11-19 00:33:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 666 states have (on average 1.2972972972972974) internal successors, (864), 668 states have internal predecessors, (864), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:33:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 992 transitions. [2024-11-19 00:33:10,079 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 992 transitions. Word has length 124 [2024-11-19 00:33:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:10,080 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 992 transitions. [2024-11-19 00:33:10,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 992 transitions. [2024-11-19 00:33:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 00:33:10,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:10,081 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 00:33:10,082 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:10,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 570259053, now seen corresponding path program 1 times [2024-11-19 00:33:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020898252] [2024-11-19 00:33:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:33:10,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:10,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020898252] [2024-11-19 00:33:10,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020898252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:33:10,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513716952] [2024-11-19 00:33:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:10,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:10,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:10,237 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:33:10,238 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:33:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:10,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:33:10,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:33:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:10,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:33:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513716952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:33:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:33:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663269082] [2024-11-19 00:33:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:10,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:33:10,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:10,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:33:10,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:10,555 INFO L87 Difference]: Start difference. First operand 745 states and 992 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:33:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:10,660 INFO L93 Difference]: Finished difference Result 1505 states and 2005 transitions. [2024-11-19 00:33:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:33:10,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-19 00:33:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:10,665 INFO L225 Difference]: With dead ends: 1505 [2024-11-19 00:33:10,665 INFO L226 Difference]: Without dead ends: 763 [2024-11-19 00:33:10,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:33:10,669 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:10,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:33:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-19 00:33:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2024-11-19 00:33:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 684 states have (on average 1.2894736842105263) internal successors, (882), 686 states have internal predecessors, (882), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:33:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1010 transitions. [2024-11-19 00:33:10,755 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1010 transitions. Word has length 124 [2024-11-19 00:33:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:10,756 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1010 transitions. [2024-11-19 00:33:10,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:33:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1010 transitions. [2024-11-19 00:33:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 00:33:10,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:10,757 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:10,778 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:33:10,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:33:10,962 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:10,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:10,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1111849902, now seen corresponding path program 1 times [2024-11-19 00:33:10,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:10,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886515933] [2024-11-19 00:33:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886515933] [2024-11-19 00:33:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886515933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:11,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:33:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489237615] [2024-11-19 00:33:11,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:11,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:11,253 INFO L87 Difference]: Start difference. First operand 763 states and 1010 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:11,428 INFO L93 Difference]: Finished difference Result 1598 states and 2107 transitions. [2024-11-19 00:33:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:33:11,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-19 00:33:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:11,433 INFO L225 Difference]: With dead ends: 1598 [2024-11-19 00:33:11,433 INFO L226 Difference]: Without dead ends: 838 [2024-11-19 00:33:11,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:11,435 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 48 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:11,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 722 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-19 00:33:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 751. [2024-11-19 00:33:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 672 states have (on average 1.28125) internal successors, (861), 674 states have internal predecessors, (861), 64 states have call successors, (64), 14 states have call predecessors, (64), 14 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-19 00:33:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 989 transitions. [2024-11-19 00:33:11,518 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 989 transitions. Word has length 126 [2024-11-19 00:33:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:11,518 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 989 transitions. [2024-11-19 00:33:11,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 989 transitions. [2024-11-19 00:33:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:33:11,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:11,520 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:11,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 00:33:11,520 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1911816657, now seen corresponding path program 1 times [2024-11-19 00:33:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351088361] [2024-11-19 00:33:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:11,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:12,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:12,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351088361] [2024-11-19 00:33:12,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351088361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:12,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:12,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 00:33:12,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521874034] [2024-11-19 00:33:12,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:12,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:33:12,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:12,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:33:12,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:33:12,755 INFO L87 Difference]: Start difference. First operand 751 states and 989 transitions. Second operand has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:13,464 INFO L93 Difference]: Finished difference Result 1472 states and 1946 transitions. [2024-11-19 00:33:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:33:13,465 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2024-11-19 00:33:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:13,468 INFO L225 Difference]: With dead ends: 1472 [2024-11-19 00:33:13,468 INFO L226 Difference]: Without dead ends: 1050 [2024-11-19 00:33:13,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:33:13,470 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 100 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:13,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 2521 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:33:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-19 00:33:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 896. [2024-11-19 00:33:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 807 states have (on average 1.2812887236679058) internal successors, (1034), 810 states have internal predecessors, (1034), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-19 00:33:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1178 transitions. [2024-11-19 00:33:13,575 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1178 transitions. Word has length 128 [2024-11-19 00:33:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:13,576 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1178 transitions. [2024-11-19 00:33:13,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1178 transitions. [2024-11-19 00:33:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:33:13,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:13,577 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:13,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 00:33:13,578 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:13,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:13,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1703092269, now seen corresponding path program 1 times [2024-11-19 00:33:13,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:13,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959745287] [2024-11-19 00:33:13,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:13,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:13,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:13,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959745287] [2024-11-19 00:33:13,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959745287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:13,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:13,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:33:13,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513542591] [2024-11-19 00:33:13,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:13,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:13,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:13,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:13,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:13,835 INFO L87 Difference]: Start difference. First operand 896 states and 1178 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:14,069 INFO L93 Difference]: Finished difference Result 1523 states and 2011 transitions. [2024-11-19 00:33:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:33:14,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2024-11-19 00:33:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:14,074 INFO L225 Difference]: With dead ends: 1523 [2024-11-19 00:33:14,074 INFO L226 Difference]: Without dead ends: 956 [2024-11-19 00:33:14,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:14,076 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 93 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:14,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1076 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-19 00:33:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 892. [2024-11-19 00:33:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 803 states have (on average 1.2789539227895392) internal successors, (1027), 806 states have internal predecessors, (1027), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-19 00:33:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1171 transitions. [2024-11-19 00:33:14,178 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1171 transitions. Word has length 128 [2024-11-19 00:33:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:14,179 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1171 transitions. [2024-11-19 00:33:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1171 transitions. [2024-11-19 00:33:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:33:14,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:14,180 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:14,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 00:33:14,181 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:14,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1839430099, now seen corresponding path program 1 times [2024-11-19 00:33:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056605596] [2024-11-19 00:33:14,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:14,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:14,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056605596] [2024-11-19 00:33:14,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056605596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:14,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:33:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913696935] [2024-11-19 00:33:14,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:14,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:33:14,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:14,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:33:14,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:33:14,441 INFO L87 Difference]: Start difference. First operand 892 states and 1171 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:14,706 INFO L93 Difference]: Finished difference Result 1693 states and 2241 transitions. [2024-11-19 00:33:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:33:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2024-11-19 00:33:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:14,716 INFO L225 Difference]: With dead ends: 1693 [2024-11-19 00:33:14,716 INFO L226 Difference]: Without dead ends: 1130 [2024-11-19 00:33:14,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:33:14,718 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 96 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:14,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 839 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:33:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-19 00:33:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 880. [2024-11-19 00:33:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 791 states have (on average 1.279393173198483) internal successors, (1012), 794 states have internal predecessors, (1012), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-19 00:33:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1156 transitions. [2024-11-19 00:33:14,828 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1156 transitions. Word has length 128 [2024-11-19 00:33:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:14,828 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1156 transitions. [2024-11-19 00:33:14,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1156 transitions. [2024-11-19 00:33:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:33:14,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:14,830 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:14,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 00:33:14,830 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:14,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1775478827, now seen corresponding path program 1 times [2024-11-19 00:33:14,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:14,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868724975] [2024-11-19 00:33:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:14,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:33:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 00:33:15,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:33:15,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868724975] [2024-11-19 00:33:15,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868724975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:33:15,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:33:15,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:33:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597346330] [2024-11-19 00:33:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:33:15,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:33:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:33:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:33:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:33:15,863 INFO L87 Difference]: Start difference. First operand 880 states and 1156 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:33:16,564 INFO L93 Difference]: Finished difference Result 1563 states and 2063 transitions. [2024-11-19 00:33:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:33:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2024-11-19 00:33:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:33:16,573 INFO L225 Difference]: With dead ends: 1563 [2024-11-19 00:33:16,573 INFO L226 Difference]: Without dead ends: 1012 [2024-11-19 00:33:16,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:33:16,575 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 94 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:33:16,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 2159 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:33:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-19 00:33:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 874. [2024-11-19 00:33:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 785 states have (on average 1.2802547770700636) internal successors, (1005), 788 states have internal predecessors, (1005), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-19 00:33:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1149 transitions. [2024-11-19 00:33:16,711 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1149 transitions. Word has length 128 [2024-11-19 00:33:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:33:16,711 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1149 transitions. [2024-11-19 00:33:16,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 00:33:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1149 transitions. [2024-11-19 00:33:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 00:33:16,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:33:16,713 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:16,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 00:33:16,713 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:33:16,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:33:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1480106236, now seen corresponding path program 1 times [2024-11-19 00:33:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:33:16,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028458520] [2024-11-19 00:33:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:33:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:33:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:33:16,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:33:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:33:16,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:33:16,884 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:33:16,885 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:33:16,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 00:33:16,890 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:33:17,011 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:33:17,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:33:17 BoogieIcfgContainer [2024-11-19 00:33:17,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:33:17,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:33:17,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:33:17,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:33:17,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:32:19" (3/4) ... [2024-11-19 00:33:17,020 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:33:17,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:33:17,022 INFO L158 Benchmark]: Toolchain (without parser) took 58833.01ms. Allocated memory was 163.6MB in the beginning and 792.7MB in the end (delta: 629.1MB). Free memory was 91.8MB in the beginning and 665.3MB in the end (delta: -573.6MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2024-11-19 00:33:17,022 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 163.6MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:33:17,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.26ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 134.4MB in the end (delta: -43.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-19 00:33:17,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.62ms. Allocated memory is still 163.6MB. Free memory was 134.4MB in the beginning and 130.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:33:17,025 INFO L158 Benchmark]: Boogie Preprocessor took 118.66ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 126.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:33:17,025 INFO L158 Benchmark]: RCFGBuilder took 858.00ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 90.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 00:33:17,025 INFO L158 Benchmark]: TraceAbstraction took 57327.88ms. Allocated memory was 163.6MB in the beginning and 792.7MB in the end (delta: 629.1MB). Free memory was 89.5MB in the beginning and 666.4MB in the end (delta: -576.9MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-11-19 00:33:17,025 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 792.7MB. Free memory was 666.4MB in the beginning and 665.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:33:17,026 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.34ms. Allocated memory is still 163.6MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.26ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 134.4MB in the end (delta: -43.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.62ms. Allocated memory is still 163.6MB. Free memory was 134.4MB in the beginning and 130.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.66ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 126.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 858.00ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 90.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 57327.88ms. Allocated memory was 163.6MB in the beginning and 792.7MB in the end (delta: 629.1MB). Free memory was 89.5MB in the beginning and 666.4MB in the end (delta: -576.9MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 792.7MB. Free memory was 666.4MB in the beginning and 665.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L25-L27] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L28-L30] signed char signed_char_Array_0[2] = { 8, -128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -10 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -10; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L91] EXPR signed_long_int_Array_0[0] [L91] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] double_Array_0[0] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] double_Array_0[1] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] double_Array_0[3] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L80] EXPR double_Array_0[3] [L80] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] double_Array_0[4] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L82] EXPR double_Array_0[4] [L82] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] RET updateVariables() [L103] CALL step() [L41] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L44] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) [L44] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L44] unsigned_long_int_Array_0[1] = ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))) [L46] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L46] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L49] EXPR BOOL_unsigned_char_Array_0[1] [L49] unsigned char stepLocal_1 = BOOL_unsigned_char_Array_0[1]; [L50] EXPR signed_long_int_Array_0[0] [L50] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L51] EXPR signed_long_int_Array_0[0] [L51] EXPR signed_long_int_Array_0[0] [L51] stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}] [L51] COND TRUE stepLocal_1 || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L52] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L52] COND FALSE !(stepLocal_0 < unsigned_long_int_Array_0[1]) [L57] signed_char_Array_0[1] = 2 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] EXPR signed_char_Array_0[1] [L62] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] COND TRUE signed_char_Array_0[1] >= signed_char_Array_0[1] [L63] EXPR double_Array_0[0] [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L63] EXPR double_Array_0[1] [L63] EXPR double_Array_0[3] [L63] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] double_Array_0[2] = (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR BOOL_unsigned_char_Array_0[1] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) [L94] EXPR signed_long_int_Array_0[0] [L94] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) [L94] EXPR signed_char_Array_0[1] [L94] EXPR (signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) [L94] EXPR unsigned_long_int_Array_0[1] [L94] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) [L94] EXPR ((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) [L94] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 [L94] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) [L94] EXPR signed_char_Array_0[1] [L94] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) [L94] EXPR double_Array_0[2] [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR double_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) [L94] EXPR double_Array_0[1] [L94] EXPR double_Array_0[3] [L94] EXPR (((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR (signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94-L95] return ((((BOOL_unsigned_char_Array_0[1] || ((~ signed_long_int_Array_0[0]) >= signed_long_int_Array_0[0])) ? ((signed_long_int_Array_0[0] < unsigned_long_int_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) : 1) : (signed_char_Array_0[1] == ((signed char) 2))) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((1514707036u + ((((unsigned_long_int_Array_0[0]) < 0 ) ? -(unsigned_long_int_Array_0[0]) : (unsigned_long_int_Array_0[0])))) - last_1_signed_long_int_Array_0_0_))) : (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > (unsigned_long_int_Array_0[0])) ? (last_1_signed_long_int_Array_0_0_) : (unsigned_long_int_Array_0[0]))))))) && (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_long_int_Array_0[1] + ((((signed_char_Array_0[0]) < 0 ) ? -(signed_char_Array_0[0]) : (signed_char_Array_0[0])))))) : 1)) && ((signed_char_Array_0[1] >= signed_char_Array_0[1]) ? (double_Array_0[2] == ((double) (double_Array_0[0] - (((((double_Array_0[1] + double_Array_0[3])) > (double_Array_0[4])) ? ((double_Array_0[1] + double_Array_0[3])) : (double_Array_0[4])))))) : (double_Array_0[2] == ((double) ((((double_Array_0[3]) > (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1])))))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.1s, OverallIterations: 36, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6763 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6745 mSDsluCounter, 44644 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37183 mSDsCounter, 880 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10052 IncrementalHoareTripleChecker+Invalid, 10932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 880 mSolverCounterUnsat, 7461 mSDtfsCounter, 10052 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 707 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 21.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=930occurred in iteration=9, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 4588 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 4594 NumberOfCodeBlocks, 4594 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4429 ConstructedInterpolants, 0 QuantifiedInterpolants, 23047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 844 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 37 InterpolantComputations, 35 PerfectInterpolantSequences, 9713/9768 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:33:17,067 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-a_file-15.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 af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:33:19,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:33:19,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:33:19,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:33:19,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:33:19,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:33:19,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:33:19,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:33:19,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:33:19,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:33:19,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:33:19,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:33:19,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:33:19,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:33:19,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:33:19,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:33:19,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:33:19,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:33:19,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:33:19,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:33:19,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:33:19,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:33:19,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:33:19,486 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:33:19,486 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:33:19,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:33:19,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:33:19,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:33:19,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:33:19,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:33:19,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:33:19,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:33:19,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:33:19,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:33:19,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:33:19,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:33:19,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:33:19,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:33:19,494 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:33:19,494 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:33:19,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:33:19,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:33:19,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:33:19,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:33:19,495 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 -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2024-11-19 00:33:19,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:33:19,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:33:19,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:33:19,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:33:19,876 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:33:19,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2024-11-19 00:33:21,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:33:21,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:33:21,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2024-11-19 00:33:21,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9d05013/d158d76eb6fd4aaf87405edfe8b0429b/FLAG255cba72b [2024-11-19 00:33:21,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9d05013/d158d76eb6fd4aaf87405edfe8b0429b [2024-11-19 00:33:21,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:33:21,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:33:21,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:33:21,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:33:21,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:33:21,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:21" (1/1) ... [2024-11-19 00:33:21,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d41c420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:21, skipping insertion in model container [2024-11-19 00:33:21,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:33:21" (1/1) ... [2024-11-19 00:33:21,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:33:21,994 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-a_file-15.i[916,929] [2024-11-19 00:33:22,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:33:22,108 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:33:22,121 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-a_file-15.i[916,929] [2024-11-19 00:33:22,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:33:22,210 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:33:22,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22 WrapperNode [2024-11-19 00:33:22,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:33:22,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:33:22,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:33:22,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:33:22,219 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:33:22" (1/1) ... [2024-11-19 00:33:22,243 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:33:22" (1/1) ... [2024-11-19 00:33:22,292 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-11-19 00:33:22,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:33:22,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:33:22,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:33:22,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:33:22,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,353 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-11-19 00:33:22,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:33:22,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:33:22,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:33:22,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:33:22,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:33:22" (1/1) ... [2024-11-19 00:33:22,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:33:22,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:33:22,452 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:33:22,456 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:33:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:33:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:33:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:33:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:33:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:33:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:33:22,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:33:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:33:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:33:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:33:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:33:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:33:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:33:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:33:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:33:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:33:22,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:33:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:33:22,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:33:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:33:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:33:22,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:33:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:33:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:33:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:33:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:33:22,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:33:22,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:33:22,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:33:22,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:33:22,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:33:22,703 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:33:22,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation