./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:21:36,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:21:36,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:21:36,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:21:36,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:21:36,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:21:36,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:21:36,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:21:36,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:21:36,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:21:36,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:21:36,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:21:36,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:21:36,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:21:36,527 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:21:36,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:21:36,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:21:36,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:21:36,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:21:36,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:21:36,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:21:36,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:21:36,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:21:36,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:21:36,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:21:36,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:21:36,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:21:36,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:21:36,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:21:36,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:21:36,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:21:36,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:21:36,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:21:36,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:21:36,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:21:36,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:21:36,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:21:36,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:21:36,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:21:36,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:21:36,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:21:36,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:21:36,538 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-clean/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-clean/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 -> f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 [2024-10-11 13:21:36,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:21:36,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:21:36,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:21:36,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:21:36,834 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:21:36,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2024-10-11 13:21:38,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:21:38,456 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:21:38,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2024-10-11 13:21:38,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cb8043634/3053745e3f984ba09fd63322a92785d1/FLAGfa3556cb0 [2024-10-11 13:21:38,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cb8043634/3053745e3f984ba09fd63322a92785d1 [2024-10-11 13:21:38,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:21:38,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:21:38,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:21:38,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:21:38,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:21:38,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:21:38" (1/1) ... [2024-10-11 13:21:38,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64df7af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:38, skipping insertion in model container [2024-10-11 13:21:38,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:21:38" (1/1) ... [2024-10-11 13:21:38,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:21:39,040 WARN L248 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-84.i[916,929] [2024-10-11 13:21:39,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:21:39,132 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:21:39,142 WARN L248 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-84.i[916,929] [2024-10-11 13:21:39,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:21:39,202 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:21:39,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39 WrapperNode [2024-10-11 13:21:39,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:21:39,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:21:39,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:21:39,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:21:39,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,280 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2024-10-11 13:21:39,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:21:39,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:21:39,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:21:39,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:21:39,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,330 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 11, 19, 72, 12]. 59 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 2, 3, 7, 2]. The 17 writes are split as follows [0, 1, 2, 4, 8, 2]. [2024-10-11 13:21:39,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:21:39,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:21:39,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:21:39,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:21:39,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (1/1) ... [2024-10-11 13:21:39,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:21:39,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:21:39,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:21:39,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:21:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:21:39,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:21:39,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:21:39,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:21:39,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:21:39,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:21:39,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:21:39,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:21:39,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:21:39,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:21:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:21:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:21:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:21:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:21:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:21:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:21:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:21:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:21:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:21:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:21:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:21:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:21:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:21:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:21:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:21:39,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:21:39,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:21:39,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:21:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:21:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:21:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:21:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:21:39,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:21:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:21:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:21:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:21:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:21:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:21:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:21:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:21:39,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:21:39,605 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:21:39,610 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:21:40,131 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-11 13:21:40,132 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:21:40,164 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:21:40,164 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:21:40,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:21:40 BoogieIcfgContainer [2024-10-11 13:21:40,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:21:40,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:21:40,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:21:40,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:21:40,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:21:38" (1/3) ... [2024-10-11 13:21:40,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e02a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:21:40, skipping insertion in model container [2024-10-11 13:21:40,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:21:39" (2/3) ... [2024-10-11 13:21:40,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e02a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:21:40, skipping insertion in model container [2024-10-11 13:21:40,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:21:40" (3/3) ... [2024-10-11 13:21:40,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-84.i [2024-10-11 13:21:40,191 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:21:40,191 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:21:40,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:21:40,258 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;@6e487ae1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:21:40,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:21:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:21:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:21:40,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:40,279 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:40,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:40,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2134703419, now seen corresponding path program 1 times [2024-10-11 13:21:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193105276] [2024-10-11 13:21:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:40,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:40,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193105276] [2024-10-11 13:21:40,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193105276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:40,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:40,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:21:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361022009] [2024-10-11 13:21:40,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:40,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:21:40,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:40,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:21:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:21:40,800 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:21:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:40,855 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-11 13:21:40,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:21:40,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-11 13:21:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:40,868 INFO L225 Difference]: With dead ends: 189 [2024-10-11 13:21:40,868 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 13:21:40,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-10-11 13:21:40,878 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:40,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:21:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 13:21:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 13:21:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:21:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-11 13:21:40,929 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2024-10-11 13:21:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:40,932 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-11 13:21:40,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:21:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-11 13:21:40,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:21:40,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:40,938 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:40,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:21:40,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1901966747, now seen corresponding path program 1 times [2024-10-11 13:21:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962654291] [2024-10-11 13:21:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:41,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:41,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962654291] [2024-10-11 13:21:41,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962654291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:41,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:41,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:21:41,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456571385] [2024-10-11 13:21:41,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:41,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:21:41,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:41,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:21:41,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:21:41,400 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:21:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:41,461 INFO L93 Difference]: Finished difference Result 189 states and 274 transitions. [2024-10-11 13:21:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:21:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-11 13:21:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:41,464 INFO L225 Difference]: With dead ends: 189 [2024-10-11 13:21:41,464 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 13:21:41,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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-10-11 13:21:41,467 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:41,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:21:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 13:21:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 13:21:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:21:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-11 13:21:41,489 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 145 [2024-10-11 13:21:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:41,490 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-11 13:21:41,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:21:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-11 13:21:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:21:41,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:41,496 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:41,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:21:41,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:41,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1848127975, now seen corresponding path program 1 times [2024-10-11 13:21:41,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:41,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918957919] [2024-10-11 13:21:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:41,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918957919] [2024-10-11 13:21:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918957919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:41,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:21:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100880572] [2024-10-11 13:21:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:41,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:21:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:21:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:21:41,769 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:21:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:41,825 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-10-11 13:21:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:21:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-11 13:21:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:41,827 INFO L225 Difference]: With dead ends: 194 [2024-10-11 13:21:41,829 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 13:21:41,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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-10-11 13:21:41,833 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:41,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:21:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 13:21:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-11 13:21:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:21:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-10-11 13:21:41,854 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 145 [2024-10-11 13:21:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:41,855 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-10-11 13:21:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:21:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-10-11 13:21:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:21:41,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:41,861 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:41,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:21:41,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1848068393, now seen corresponding path program 1 times [2024-10-11 13:21:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:41,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22463523] [2024-10-11 13:21:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:42,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22463523] [2024-10-11 13:21:42,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22463523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:42,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:42,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:21:42,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217661788] [2024-10-11 13:21:42,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:42,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:21:42,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:21:42,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:21:42,335 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:21:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:42,649 INFO L93 Difference]: Finished difference Result 318 states and 453 transitions. [2024-10-11 13:21:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:21:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-11 13:21:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:42,653 INFO L225 Difference]: With dead ends: 318 [2024-10-11 13:21:42,653 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 13:21:42,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:21:42,658 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 213 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:42,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 595 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:21:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 13:21:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 195. [2024-10-11 13:21:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:21:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2024-10-11 13:21:42,691 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 145 [2024-10-11 13:21:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:42,691 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2024-10-11 13:21:42,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:21:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2024-10-11 13:21:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 13:21:42,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:42,696 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:42,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:21:42,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:42,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash 152864249, now seen corresponding path program 1 times [2024-10-11 13:21:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425692714] [2024-10-11 13:21:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:44,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:44,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425692714] [2024-10-11 13:21:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425692714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:44,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:21:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395817176] [2024-10-11 13:21:44,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:44,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:21:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:44,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:21:44,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:21:44,801 INFO L87 Difference]: Start difference. First operand 195 states and 278 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:45,615 INFO L93 Difference]: Finished difference Result 525 states and 743 transitions. [2024-10-11 13:21:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:21:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2024-10-11 13:21:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:45,619 INFO L225 Difference]: With dead ends: 525 [2024-10-11 13:21:45,619 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 13:21:45,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:21:45,625 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 91 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:45,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1390 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:21:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 13:21:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2024-10-11 13:21:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 270 states have internal predecessors, (353), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:21:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 461 transitions. [2024-10-11 13:21:45,663 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 461 transitions. Word has length 153 [2024-10-11 13:21:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:45,664 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 461 transitions. [2024-10-11 13:21:45,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 461 transitions. [2024-10-11 13:21:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:45,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:45,666 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:45,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:21:45,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:45,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash 535407572, now seen corresponding path program 1 times [2024-10-11 13:21:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:45,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314567787] [2024-10-11 13:21:45,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:45,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:47,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:47,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314567787] [2024-10-11 13:21:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314567787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:47,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:47,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:21:47,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698748932] [2024-10-11 13:21:47,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:47,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:21:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:47,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:21:47,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:21:47,493 INFO L87 Difference]: Start difference. First operand 327 states and 461 transitions. Second operand has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:48,460 INFO L93 Difference]: Finished difference Result 795 states and 1119 transitions. [2024-10-11 13:21:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:21:48,460 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-11 13:21:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:48,466 INFO L225 Difference]: With dead ends: 795 [2024-10-11 13:21:48,467 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 13:21:48,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:21:48,470 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 80 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:48,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1003 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:21:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 13:21:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 367. [2024-10-11 13:21:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 308 states have (on average 1.3311688311688312) internal successors, (410), 310 states have internal predecessors, (410), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:21:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 518 transitions. [2024-10-11 13:21:48,512 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 518 transitions. Word has length 155 [2024-10-11 13:21:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:48,512 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 518 transitions. [2024-10-11 13:21:48,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 518 transitions. [2024-10-11 13:21:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:48,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:48,516 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:21:48,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:48,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash -744456106, now seen corresponding path program 1 times [2024-10-11 13:21:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718420428] [2024-10-11 13:21:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:49,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:49,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718420428] [2024-10-11 13:21:49,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718420428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:49,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:49,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:21:49,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866981247] [2024-10-11 13:21:49,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:49,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:21:49,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:49,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:21:49,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:21:49,862 INFO L87 Difference]: Start difference. First operand 367 states and 518 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:50,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:50,577 INFO L93 Difference]: Finished difference Result 835 states and 1174 transitions. [2024-10-11 13:21:50,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:21:50,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-11 13:21:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:50,582 INFO L225 Difference]: With dead ends: 835 [2024-10-11 13:21:50,582 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 13:21:50,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:21:50,584 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 77 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:50,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 969 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:21:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 13:21:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 363. [2024-10-11 13:21:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 304 states have (on average 1.3289473684210527) internal successors, (404), 306 states have internal predecessors, (404), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:21:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 512 transitions. [2024-10-11 13:21:50,618 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 512 transitions. Word has length 155 [2024-10-11 13:21:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:50,618 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 512 transitions. [2024-10-11 13:21:50,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 512 transitions. [2024-10-11 13:21:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:50,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:50,620 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:50,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:21:50,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:50,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1298567520, now seen corresponding path program 1 times [2024-10-11 13:21:50,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:50,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370650680] [2024-10-11 13:21:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:50,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370650680] [2024-10-11 13:21:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370650680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:50,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:21:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583211340] [2024-10-11 13:21:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:50,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:21:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:21:50,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:21:50,855 INFO L87 Difference]: Start difference. First operand 363 states and 512 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:21:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:50,904 INFO L93 Difference]: Finished difference Result 737 states and 1039 transitions. [2024-10-11 13:21:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:21:50,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-11 13:21:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:50,907 INFO L225 Difference]: With dead ends: 737 [2024-10-11 13:21:50,907 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 13:21:50,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:21:50,911 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:50,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:21:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 13:21:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-11 13:21:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 316 states have (on average 1.3164556962025316) internal successors, (416), 318 states have internal predecessors, (416), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:21:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 524 transitions. [2024-10-11 13:21:50,947 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 524 transitions. Word has length 155 [2024-10-11 13:21:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:50,948 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 524 transitions. [2024-10-11 13:21:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:21:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 524 transitions. [2024-10-11 13:21:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:50,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:50,950 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:50,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:21:50,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:50,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1999632098, now seen corresponding path program 1 times [2024-10-11 13:21:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443190981] [2024-10-11 13:21:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443190981] [2024-10-11 13:21:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443190981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:52,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:52,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:21:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841434608] [2024-10-11 13:21:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:52,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:21:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:52,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:21:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:21:52,609 INFO L87 Difference]: Start difference. First operand 375 states and 524 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:53,463 INFO L93 Difference]: Finished difference Result 1061 states and 1479 transitions. [2024-10-11 13:21:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:21:53,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-11 13:21:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:53,468 INFO L225 Difference]: With dead ends: 1061 [2024-10-11 13:21:53,468 INFO L226 Difference]: Without dead ends: 687 [2024-10-11 13:21:53,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:21:53,469 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 83 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:53,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1055 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:21:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-11 13:21:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 671. [2024-10-11 13:21:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 570 states have (on average 1.3210526315789475) internal successors, (753), 576 states have internal predecessors, (753), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 13:21:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 937 transitions. [2024-10-11 13:21:53,547 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 937 transitions. Word has length 155 [2024-10-11 13:21:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:53,548 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 937 transitions. [2024-10-11 13:21:53,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 937 transitions. [2024-10-11 13:21:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:53,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:53,551 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:53,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:21:53,551 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:53,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash 309196788, now seen corresponding path program 1 times [2024-10-11 13:21:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037517707] [2024-10-11 13:21:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:54,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037517707] [2024-10-11 13:21:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037517707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:54,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:54,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:21:54,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393127724] [2024-10-11 13:21:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:54,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:21:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:54,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:21:54,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:21:54,762 INFO L87 Difference]: Start difference. First operand 671 states and 937 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:55,538 INFO L93 Difference]: Finished difference Result 1623 states and 2258 transitions. [2024-10-11 13:21:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:21:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-11 13:21:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:55,545 INFO L225 Difference]: With dead ends: 1623 [2024-10-11 13:21:55,546 INFO L226 Difference]: Without dead ends: 953 [2024-10-11 13:21:55,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:21:55,548 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 79 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:55,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 940 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:21:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-10-11 13:21:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 721. [2024-10-11 13:21:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 620 states have (on average 1.3274193548387097) internal successors, (823), 626 states have internal predecessors, (823), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 13:21:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1007 transitions. [2024-10-11 13:21:55,625 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1007 transitions. Word has length 155 [2024-10-11 13:21:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:55,625 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1007 transitions. [2024-10-11 13:21:55,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:21:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1007 transitions. [2024-10-11 13:21:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:55,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:55,629 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:55,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:21:55,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:55,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1279151114, now seen corresponding path program 1 times [2024-10-11 13:21:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947298772] [2024-10-11 13:21:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:55,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947298772] [2024-10-11 13:21:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947298772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:56,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:56,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:21:56,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2895917] [2024-10-11 13:21:56,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:56,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:21:56,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:56,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:21:56,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:21:56,050 INFO L87 Difference]: Start difference. First operand 721 states and 1007 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:21:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:56,501 INFO L93 Difference]: Finished difference Result 1933 states and 2684 transitions. [2024-10-11 13:21:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:21:56,501 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-11 13:21:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:56,508 INFO L225 Difference]: With dead ends: 1933 [2024-10-11 13:21:56,509 INFO L226 Difference]: Without dead ends: 1213 [2024-10-11 13:21:56,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-10-11 13:21:56,513 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 78 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:56,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 429 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:21:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-10-11 13:21:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 783. [2024-10-11 13:21:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 682 states have (on average 1.3211143695014662) internal successors, (901), 688 states have internal predecessors, (901), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 13:21:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1085 transitions. [2024-10-11 13:21:56,594 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1085 transitions. Word has length 155 [2024-10-11 13:21:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:56,595 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1085 transitions. [2024-10-11 13:21:56,595 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:21:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1085 transitions. [2024-10-11 13:21:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:56,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:56,598 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:56,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:21:56,598 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:56,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:56,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2004698932, now seen corresponding path program 1 times [2024-10-11 13:21:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:56,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843040137] [2024-10-11 13:21:56,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:57,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:57,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:57,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843040137] [2024-10-11 13:21:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843040137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:58,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:58,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:21:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117576652] [2024-10-11 13:21:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:58,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:21:58,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:21:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:21:58,034 INFO L87 Difference]: Start difference. First operand 783 states and 1085 transitions. Second operand has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 13:21:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:59,034 INFO L93 Difference]: Finished difference Result 1807 states and 2492 transitions. [2024-10-11 13:21:59,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:21:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-11 13:21:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:59,040 INFO L225 Difference]: With dead ends: 1807 [2024-10-11 13:21:59,040 INFO L226 Difference]: Without dead ends: 1017 [2024-10-11 13:21:59,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:21:59,043 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:59,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 977 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:21:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-10-11 13:21:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 779. [2024-10-11 13:21:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 678 states have (on average 1.317109144542773) internal successors, (893), 684 states have internal predecessors, (893), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 13:21:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1077 transitions. [2024-10-11 13:21:59,128 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1077 transitions. Word has length 155 [2024-10-11 13:21:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:59,129 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1077 transitions. [2024-10-11 13:21:59,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 13:21:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1077 transitions. [2024-10-11 13:21:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:59,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:59,131 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:59,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:21:59,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:59,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2133645604, now seen corresponding path program 1 times [2024-10-11 13:21:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:59,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82068711] [2024-10-11 13:21:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:21:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:21:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:21:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:21:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:21:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:21:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:21:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:21:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:21:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:21:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:21:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:21:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:21:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:21:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:21:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:21:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:21:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:21:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:21:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:21:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:21:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:21:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:21:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82068711] [2024-10-11 13:21:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82068711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:21:59,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:21:59,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:21:59,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928626906] [2024-10-11 13:21:59,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:21:59,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:21:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:21:59,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:21:59,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:21:59,464 INFO L87 Difference]: Start difference. First operand 779 states and 1077 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:21:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:21:59,626 INFO L93 Difference]: Finished difference Result 1635 states and 2258 transitions. [2024-10-11 13:21:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:21:59,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 13:21:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:21:59,632 INFO L225 Difference]: With dead ends: 1635 [2024-10-11 13:21:59,632 INFO L226 Difference]: Without dead ends: 857 [2024-10-11 13:21:59,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-10-11 13:21:59,635 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 37 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:21:59,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 763 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:21:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-10-11 13:21:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 771. [2024-10-11 13:21:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 670 states have (on average 1.308955223880597) internal successors, (877), 676 states have internal predecessors, (877), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-11 13:21:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1061 transitions. [2024-10-11 13:21:59,725 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1061 transitions. Word has length 155 [2024-10-11 13:21:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:21:59,726 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1061 transitions. [2024-10-11 13:21:59,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:21:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1061 transitions. [2024-10-11 13:21:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:21:59,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:21:59,728 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:21:59,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:21:59,728 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:21:59,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:21:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1921610966, now seen corresponding path program 1 times [2024-10-11 13:21:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:21:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020445120] [2024-10-11 13:21:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:21:59,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:21:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:00,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:00,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020445120] [2024-10-11 13:22:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020445120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:00,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:00,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:22:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813075029] [2024-10-11 13:22:00,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:00,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:22:00,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:00,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:22:00,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:22:00,307 INFO L87 Difference]: Start difference. First operand 771 states and 1061 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:22:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:00,855 INFO L93 Difference]: Finished difference Result 1952 states and 2676 transitions. [2024-10-11 13:22:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:22:00,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 13:22:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:00,861 INFO L225 Difference]: With dead ends: 1952 [2024-10-11 13:22:00,861 INFO L226 Difference]: Without dead ends: 1182 [2024-10-11 13:22:00,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-10-11 13:22:00,864 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 100 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:00,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 502 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:22:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-11 13:22:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 812. [2024-10-11 13:22:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 704 states have (on average 1.3082386363636365) internal successors, (921), 710 states have internal predecessors, (921), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 13:22:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1115 transitions. [2024-10-11 13:22:00,983 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1115 transitions. Word has length 155 [2024-10-11 13:22:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:00,984 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1115 transitions. [2024-10-11 13:22:00,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:22:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1115 transitions. [2024-10-11 13:22:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:22:00,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:00,986 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:00,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:22:00,987 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:00,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:00,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1983650580, now seen corresponding path program 1 times [2024-10-11 13:22:00,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:00,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121393203] [2024-10-11 13:22:00,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:02,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:02,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:02,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:02,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121393203] [2024-10-11 13:22:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121393203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:02,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:22:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816214718] [2024-10-11 13:22:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:02,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:22:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:02,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:22:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:22:02,006 INFO L87 Difference]: Start difference. First operand 812 states and 1115 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:02,756 INFO L93 Difference]: Finished difference Result 1743 states and 2384 transitions. [2024-10-11 13:22:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:22:02,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-11 13:22:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:02,762 INFO L225 Difference]: With dead ends: 1743 [2024-10-11 13:22:02,762 INFO L226 Difference]: Without dead ends: 932 [2024-10-11 13:22:02,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:22:02,765 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 153 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:02,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 559 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:22:02,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-11 13:22:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 800. [2024-10-11 13:22:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 692 states have (on average 1.2904624277456647) internal successors, (893), 698 states have internal predecessors, (893), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 13:22:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1087 transitions. [2024-10-11 13:22:02,866 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1087 transitions. Word has length 155 [2024-10-11 13:22:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:02,867 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1087 transitions. [2024-10-11 13:22:02,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1087 transitions. [2024-10-11 13:22:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:22:02,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:02,869 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:02,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:22:02,869 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 703786902, now seen corresponding path program 1 times [2024-10-11 13:22:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251408251] [2024-10-11 13:22:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:03,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251408251] [2024-10-11 13:22:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251408251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:03,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:22:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339345150] [2024-10-11 13:22:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:03,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:22:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:03,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:22:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:22:03,847 INFO L87 Difference]: Start difference. First operand 800 states and 1087 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:04,669 INFO L93 Difference]: Finished difference Result 1693 states and 2295 transitions. [2024-10-11 13:22:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:22:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-11 13:22:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:04,675 INFO L225 Difference]: With dead ends: 1693 [2024-10-11 13:22:04,675 INFO L226 Difference]: Without dead ends: 894 [2024-10-11 13:22:04,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:22:04,677 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 74 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:04,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 987 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:22:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-11 13:22:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 680. [2024-10-11 13:22:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 593 states have (on average 1.2934232715008431) internal successors, (767), 597 states have internal predecessors, (767), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:22:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 923 transitions. [2024-10-11 13:22:04,782 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 923 transitions. Word has length 155 [2024-10-11 13:22:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 923 transitions. [2024-10-11 13:22:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 923 transitions. [2024-10-11 13:22:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:22:04,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:04,785 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:04,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:22:04,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:04,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:04,786 INFO L85 PathProgramCache]: Analyzing trace with hash -904064970, now seen corresponding path program 1 times [2024-10-11 13:22:04,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:04,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469333392] [2024-10-11 13:22:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:04,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469333392] [2024-10-11 13:22:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469333392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:05,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:05,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:22:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545670316] [2024-10-11 13:22:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:05,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:22:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:22:05,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:22:05,783 INFO L87 Difference]: Start difference. First operand 680 states and 923 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:06,390 INFO L93 Difference]: Finished difference Result 1471 states and 1991 transitions. [2024-10-11 13:22:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:22:06,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-11 13:22:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:06,395 INFO L225 Difference]: With dead ends: 1471 [2024-10-11 13:22:06,395 INFO L226 Difference]: Without dead ends: 792 [2024-10-11 13:22:06,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:22:06,397 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 72 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:06,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1209 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:22:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-10-11 13:22:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 672. [2024-10-11 13:22:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 585 states have (on average 1.2905982905982907) internal successors, (755), 589 states have internal predecessors, (755), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:22:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 911 transitions. [2024-10-11 13:22:06,474 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 911 transitions. Word has length 155 [2024-10-11 13:22:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:06,475 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 911 transitions. [2024-10-11 13:22:06,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 911 transitions. [2024-10-11 13:22:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 13:22:06,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:06,477 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:06,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:22:06,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1433857265, now seen corresponding path program 1 times [2024-10-11 13:22:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:06,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316652984] [2024-10-11 13:22:06,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316652984] [2024-10-11 13:22:07,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316652984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:07,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:07,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 13:22:07,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902704299] [2024-10-11 13:22:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:07,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 13:22:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 13:22:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:22:07,726 INFO L87 Difference]: Start difference. First operand 672 states and 911 transitions. Second operand has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:09,330 INFO L93 Difference]: Finished difference Result 2283 states and 3072 transitions. [2024-10-11 13:22:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 13:22:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-10-11 13:22:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:09,342 INFO L225 Difference]: With dead ends: 2283 [2024-10-11 13:22:09,342 INFO L226 Difference]: Without dead ends: 1612 [2024-10-11 13:22:09,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-10-11 13:22:09,344 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 388 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:09,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1709 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 13:22:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2024-10-11 13:22:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1040. [2024-10-11 13:22:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 893 states have (on average 1.2754759238521836) internal successors, (1139), 901 states have internal predecessors, (1139), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 122 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-11 13:22:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1399 transitions. [2024-10-11 13:22:09,462 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1399 transitions. Word has length 157 [2024-10-11 13:22:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:09,463 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1399 transitions. [2024-10-11 13:22:09,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1399 transitions. [2024-10-11 13:22:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 13:22:09,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:09,465 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:22:09,465 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:09,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1849992781, now seen corresponding path program 1 times [2024-10-11 13:22:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:09,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685186380] [2024-10-11 13:22:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:10,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:11,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:11,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:11,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:11,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685186380] [2024-10-11 13:22:11,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685186380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:11,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:11,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:22:11,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232063442] [2024-10-11 13:22:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:11,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:22:11,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:11,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:22:11,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:22:11,013 INFO L87 Difference]: Start difference. First operand 1040 states and 1399 transitions. Second operand has 14 states, 11 states have (on average 5.454545454545454) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 13:22:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:12,212 INFO L93 Difference]: Finished difference Result 2277 states and 3062 transitions. [2024-10-11 13:22:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:22:12,213 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.454545454545454) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2024-10-11 13:22:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:12,219 INFO L225 Difference]: With dead ends: 2277 [2024-10-11 13:22:12,220 INFO L226 Difference]: Without dead ends: 1238 [2024-10-11 13:22:12,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:22:12,223 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 75 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:12,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1459 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:22:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-10-11 13:22:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1040. [2024-10-11 13:22:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 893 states have (on average 1.2620380739081747) internal successors, (1127), 901 states have internal predecessors, (1127), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 122 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-11 13:22:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1387 transitions. [2024-10-11 13:22:12,382 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1387 transitions. Word has length 157 [2024-10-11 13:22:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:12,382 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1387 transitions. [2024-10-11 13:22:12,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.454545454545454) internal successors, (60), 14 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 13:22:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1387 transitions. [2024-10-11 13:22:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 13:22:12,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:12,384 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:12,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:22:12,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:12,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:12,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1215002547, now seen corresponding path program 1 times [2024-10-11 13:22:12,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:12,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912692549] [2024-10-11 13:22:12,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912692549] [2024-10-11 13:22:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912692549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:13,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 13:22:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965629940] [2024-10-11 13:22:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:13,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:22:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:22:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:22:13,412 INFO L87 Difference]: Start difference. First operand 1040 states and 1387 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:14,488 INFO L93 Difference]: Finished difference Result 2083 states and 2776 transitions. [2024-10-11 13:22:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:22:14,489 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-10-11 13:22:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:14,494 INFO L225 Difference]: With dead ends: 2083 [2024-10-11 13:22:14,495 INFO L226 Difference]: Without dead ends: 1044 [2024-10-11 13:22:14,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:22:14,499 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 101 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:14,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1861 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:22:14,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-10-11 13:22:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 992. [2024-10-11 13:22:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 845 states have (on average 1.2650887573964498) internal successors, (1069), 853 states have internal predecessors, (1069), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 122 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-11 13:22:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1329 transitions. [2024-10-11 13:22:14,679 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1329 transitions. Word has length 157 [2024-10-11 13:22:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:14,679 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1329 transitions. [2024-10-11 13:22:14,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:22:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1329 transitions. [2024-10-11 13:22:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 13:22:14,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:14,681 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:14,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:22:14,681 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:14,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1943330355, now seen corresponding path program 1 times [2024-10-11 13:22:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619864208] [2024-10-11 13:22:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619864208] [2024-10-11 13:22:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619864208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:14,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:22:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819536092] [2024-10-11 13:22:14,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:14,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:22:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:22:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:22:14,899 INFO L87 Difference]: Start difference. First operand 992 states and 1329 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:22:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:15,261 INFO L93 Difference]: Finished difference Result 2091 states and 2789 transitions. [2024-10-11 13:22:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:22:15,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-11 13:22:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:15,269 INFO L225 Difference]: With dead ends: 2091 [2024-10-11 13:22:15,269 INFO L226 Difference]: Without dead ends: 1100 [2024-10-11 13:22:15,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:22:15,272 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 99 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:15,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 484 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:22:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-10-11 13:22:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 783. [2024-10-11 13:22:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 669 states have (on average 1.266068759342302) internal successors, (847), 674 states have internal predecessors, (847), 99 states have call successors, (99), 14 states have call predecessors, (99), 14 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 13:22:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1045 transitions. [2024-10-11 13:22:15,410 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1045 transitions. Word has length 157 [2024-10-11 13:22:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:15,411 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1045 transitions. [2024-10-11 13:22:15,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:22:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1045 transitions. [2024-10-11 13:22:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 13:22:15,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:15,412 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:15,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 13:22:15,413 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:15,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1096550798, now seen corresponding path program 1 times [2024-10-11 13:22:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:15,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650585698] [2024-10-11 13:22:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650585698] [2024-10-11 13:22:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650585698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:15,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:15,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:22:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910083367] [2024-10-11 13:22:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:15,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:22:15,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:22:15,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:22:15,579 INFO L87 Difference]: Start difference. First operand 783 states and 1045 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:22:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:15,776 INFO L93 Difference]: Finished difference Result 1586 states and 2117 transitions. [2024-10-11 13:22:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:22:15,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-11 13:22:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:15,784 INFO L225 Difference]: With dead ends: 1586 [2024-10-11 13:22:15,784 INFO L226 Difference]: Without dead ends: 804 [2024-10-11 13:22:15,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:22:15,787 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:15,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:22:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-11 13:22:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2024-10-11 13:22:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 690 states have (on average 1.2579710144927536) internal successors, (868), 695 states have internal predecessors, (868), 99 states have call successors, (99), 14 states have call predecessors, (99), 14 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 13:22:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1066 transitions. [2024-10-11 13:22:15,984 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1066 transitions. Word has length 157 [2024-10-11 13:22:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:15,985 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1066 transitions. [2024-10-11 13:22:15,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:22:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1066 transitions. [2024-10-11 13:22:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 13:22:15,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:15,987 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:15,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 13:22:15,987 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash 453771663, now seen corresponding path program 1 times [2024-10-11 13:22:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:15,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804776031] [2024-10-11 13:22:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804776031] [2024-10-11 13:22:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804776031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:19,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 13:22:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382105791] [2024-10-11 13:22:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:19,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 13:22:19,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 13:22:19,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:22:19,074 INFO L87 Difference]: Start difference. First operand 804 states and 1066 transitions. Second operand has 22 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 13:22:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:23,639 INFO L93 Difference]: Finished difference Result 2107 states and 2778 transitions. [2024-10-11 13:22:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 13:22:23,640 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2024-10-11 13:22:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:23,645 INFO L225 Difference]: With dead ends: 2107 [2024-10-11 13:22:23,645 INFO L226 Difference]: Without dead ends: 1304 [2024-10-11 13:22:23,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 13:22:23,648 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 350 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:23,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 2625 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 13:22:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2024-10-11 13:22:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 794. [2024-10-11 13:22:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 680 states have (on average 1.2573529411764706) internal successors, (855), 685 states have internal predecessors, (855), 99 states have call successors, (99), 14 states have call predecessors, (99), 14 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 13:22:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1053 transitions. [2024-10-11 13:22:23,808 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1053 transitions. Word has length 157 [2024-10-11 13:22:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:23,809 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1053 transitions. [2024-10-11 13:22:23,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 13:22:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1053 transitions. [2024-10-11 13:22:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 13:22:23,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:23,810 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:23,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 13:22:23,811 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:23,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash -113749867, now seen corresponding path program 1 times [2024-10-11 13:22:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:23,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952893681] [2024-10-11 13:22:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:22:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:22:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:22:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 13:22:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:22:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:22:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:22:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:22:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:22:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:22:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:22:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:22:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:22:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:22:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:22:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:22:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:22:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:22:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:22:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:22:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:22:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952893681] [2024-10-11 13:22:24,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952893681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:24,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:24,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:22:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221486637] [2024-10-11 13:22:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:24,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:22:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:22:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:22:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:22:24,141 INFO L87 Difference]: Start difference. First operand 794 states and 1053 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:22:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:24,347 INFO L93 Difference]: Finished difference Result 1729 states and 2286 transitions. [2024-10-11 13:22:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:22:24,348 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2024-10-11 13:22:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:24,353 INFO L225 Difference]: With dead ends: 1729 [2024-10-11 13:22:24,353 INFO L226 Difference]: Without dead ends: 936 [2024-10-11 13:22:24,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-10-11 13:22:24,355 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:24,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 624 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:22:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-10-11 13:22:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 794. [2024-10-11 13:22:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 680 states have (on average 1.2485294117647059) internal successors, (849), 685 states have internal predecessors, (849), 99 states have call successors, (99), 14 states have call predecessors, (99), 14 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 13:22:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1047 transitions. [2024-10-11 13:22:24,495 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1047 transitions. Word has length 159 [2024-10-11 13:22:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:24,496 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1047 transitions. [2024-10-11 13:22:24,496 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:22:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1047 transitions. [2024-10-11 13:22:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 13:22:24,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:24,497 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:24,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 13:22:24,498 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1166113811, now seen corresponding path program 1 times [2024-10-11 13:22:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:22:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293574800] [2024-10-11 13:22:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:22:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:22:24,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:22:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:22:24,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:22:24,789 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:22:24,790 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:22:24,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 13:22:24,795 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] [2024-10-11 13:22:24,914 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:22:24,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:22:24 BoogieIcfgContainer [2024-10-11 13:22:24,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:22:24,918 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:22:24,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:22:24,918 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:22:24,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:21:40" (3/4) ... [2024-10-11 13:22:24,920 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:22:24,921 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:22:24,922 INFO L158 Benchmark]: Toolchain (without parser) took 46091.44ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 140.0MB in the beginning and 910.8MB in the end (delta: -770.7MB). Peak memory consumption was 230.7MB. Max. memory is 16.1GB. [2024-10-11 13:22:24,925 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:22:24,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.28ms. Allocated memory is still 174.1MB. Free memory was 140.0MB in the beginning and 123.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:22:24,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.50ms. Allocated memory is still 174.1MB. Free memory was 123.3MB in the beginning and 118.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:22:24,925 INFO L158 Benchmark]: Boogie Preprocessor took 91.32ms. Allocated memory is still 174.1MB. Free memory was 118.0MB in the beginning and 112.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:22:24,926 INFO L158 Benchmark]: RCFGBuilder took 792.06ms. Allocated memory is still 174.1MB. Free memory was 112.8MB in the beginning and 110.0MB in the end (delta: 2.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:22:24,926 INFO L158 Benchmark]: TraceAbstraction took 44749.03ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 109.0MB in the beginning and 910.8MB in the end (delta: -801.8MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. [2024-10-11 13:22:24,926 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 1.2GB. Free memory is still 910.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:22:24,928 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.28ms. Allocated memory is still 174.1MB. Free memory was 140.0MB in the beginning and 123.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.50ms. Allocated memory is still 174.1MB. Free memory was 123.3MB in the beginning and 118.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.32ms. Allocated memory is still 174.1MB. Free memory was 118.0MB in the beginning and 112.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 792.06ms. Allocated memory is still 174.1MB. Free memory was 112.8MB in the beginning and 110.0MB in the end (delta: 2.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 44749.03ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 109.0MB in the beginning and 910.8MB in the end (delta: -801.8MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 1.2GB. Free memory is still 910.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L37] signed short int last_1_signed_short_int_Array_0_0_ = -4; [L38] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 64; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L96] EXPR signed_short_int_Array_0[0] [L96] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L97] EXPR unsigned_short_int_Array_0[0] [L97] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] float_Array_0[1] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L68] EXPR float_Array_0[1] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L70] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L73] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L76] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[2] != 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[2] != 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[4] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[4] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_char_Array_0[5] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L108] RET updateVariables() [L109] CALL step() [L42] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, stepLocal_0=-4, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE stepLocal_0 != last_1_unsigned_short_int_Array_0_0_ [L44] EXPR unsigned_char_Array_0[5] [L44] EXPR unsigned_char_Array_0[4] [L44] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) [L44] EXPR unsigned_char_Array_0[4] [L44] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) [L44] EXPR unsigned_char_Array_0[1] [L44] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] unsigned_char_Array_0[6] = (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))) [L48] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE BOOL_unsigned_char_Array_0[0] [L49] EXPR unsigned_short_int_Array_0[1] [L49] EXPR unsigned_char_Array_0[3] [L49] unsigned_short_int_Array_0[0] = ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])) [L51] EXPR unsigned_char_Array_0[4] [L51] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND TRUE ! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1]) [L52] signed_short_int_Array_0[1] = (32 - 8) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR float_Array_0[1] [L56] float_Array_0[0] = float_Array_0[1] [L57] EXPR unsigned_char_Array_0[6] [L57] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5])) [L100] EXPR unsigned_char_Array_0[6] [L100] EXPR unsigned_char_Array_0[5] [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) [L100] EXPR unsigned_char_Array_0[1] [L100] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1 [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR unsigned_short_int_Array_0[1] [L100] EXPR unsigned_char_Array_0[3] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) [L100] EXPR unsigned_char_Array_0[6] [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1 [L100] EXPR (unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))) [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR (! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L100] EXPR float_Array_0[0] [L100] EXPR float_Array_0[1] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100-L101] return (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.6s, OverallIterations: 25, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2301 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2269 mSDsluCounter, 22048 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18559 mSDsCounter, 380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12945 IncrementalHoareTripleChecker+Invalid, 13325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 380 mSolverCounterUnsat, 3489 mSDtfsCounter, 12945 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1396 GetRequests, 1140 SyntacticMatches, 3 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1040occurred in iteration=18, InterpolantAutomatonStates: 232, 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, 24 MinimizatonAttempts, 3868 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 3853 NumberOfCodeBlocks, 3853 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3670 ConstructedInterpolants, 0 QuantifiedInterpolants, 18090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 18240/18240 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-10-11 13:22:25,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:22:27,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:22:27,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:22:27,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:22:27,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:22:27,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:22:27,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:22:27,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:22:27,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:22:27,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:22:27,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:22:27,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:22:27,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:22:27,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:22:27,323 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:22:27,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:22:27,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:22:27,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:22:27,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:22:27,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:22:27,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:22:27,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:22:27,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:22:27,326 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:22:27,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:22:27,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:22:27,327 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:22:27,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:22:27,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:22:27,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:22:27,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:22:27,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:22:27,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:22:27,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:22:27,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:22:27,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:22:27,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:22:27,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:22:27,332 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:22:27,332 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:22:27,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:22:27,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:22:27,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:22:27,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:22:27,333 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:22:27,333 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-clean/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-clean/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 -> f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 [2024-10-11 13:22:27,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:22:27,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:22:27,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:22:27,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:22:27,669 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:22:27,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2024-10-11 13:22:29,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:22:29,547 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:22:29,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2024-10-11 13:22:29,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/610924333/dc89eb54853a4ac0bb1a06411f8ced22/FLAGda8d532d9 [2024-10-11 13:22:29,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/610924333/dc89eb54853a4ac0bb1a06411f8ced22 [2024-10-11 13:22:29,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:22:29,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:22:29,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:22:29,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:22:29,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:22:29,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:22:29" (1/1) ... [2024-10-11 13:22:29,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d214d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:29, skipping insertion in model container [2024-10-11 13:22:29,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:22:29" (1/1) ... [2024-10-11 13:22:29,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:22:29,828 WARN L248 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-84.i[916,929] [2024-10-11 13:22:29,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:22:29,923 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:22:29,936 WARN L248 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-84.i[916,929] [2024-10-11 13:22:29,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:22:30,003 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:22:30,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30 WrapperNode [2024-10-11 13:22:30,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:22:30,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:22:30,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:22:30,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:22:30,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,068 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2024-10-11 13:22:30,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:22:30,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:22:30,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:22:30,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:22:30,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,116 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 11, 19, 72, 12]. 59 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 2, 3, 7, 2]. The 17 writes are split as follows [0, 1, 2, 4, 8, 2]. [2024-10-11 13:22:30,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:22:30,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:22:30,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:22:30,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:22:30,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (1/1) ... [2024-10-11 13:22:30,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:22:30,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:22:30,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:22:30,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:22:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:22:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:22:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:22:30,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:22:30,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:22:30,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:22:30,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:22:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:22:30,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:22:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:22:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:22:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:22:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:22:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:22:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:22:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:22:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:22:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:22:30,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:22:30,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:22:30,474 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:22:30,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:22:31,141 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-11 13:22:31,141 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:22:31,199 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:22:31,200 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:22:31,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:22:31 BoogieIcfgContainer [2024-10-11 13:22:31,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:22:31,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:22:31,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:22:31,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:22:31,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:22:29" (1/3) ... [2024-10-11 13:22:31,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6a6736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:22:31, skipping insertion in model container [2024-10-11 13:22:31,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:22:30" (2/3) ... [2024-10-11 13:22:31,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6a6736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:22:31, skipping insertion in model container [2024-10-11 13:22:31,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:22:31" (3/3) ... [2024-10-11 13:22:31,210 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-84.i [2024-10-11 13:22:31,241 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:22:31,241 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:22:31,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:22:31,316 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;@457a1a3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:22:31,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:22:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:22:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:22:31,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:31,335 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:31,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:31,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2134703419, now seen corresponding path program 1 times [2024-10-11 13:22:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:22:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118962983] [2024-10-11 13:22:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:31,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:31,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:22:31,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:22:31,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:22:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:31,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:22:31,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:22:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-11 13:22:31,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:22:31,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:22:31,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118962983] [2024-10-11 13:22:31,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118962983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:31,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:31,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:22:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130033485] [2024-10-11 13:22:31,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:31,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:22:31,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:22:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:22:31,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:22:31,755 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:22:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:31,818 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-11 13:22:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:22:31,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-11 13:22:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:31,829 INFO L225 Difference]: With dead ends: 189 [2024-10-11 13:22:31,829 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 13:22:31,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-10-11 13:22:31,848 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:31,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:22:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 13:22:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 13:22:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:22:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-11 13:22:31,903 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2024-10-11 13:22:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:31,905 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-11 13:22:31,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:22:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-11 13:22:31,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:22:31,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:31,910 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:31,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:22:32,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:32,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:32,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1901966747, now seen corresponding path program 1 times [2024-10-11 13:22:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:22:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026695502] [2024-10-11 13:22:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:32,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:32,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:22:32,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:22:32,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:22:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:32,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:22:32,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:22:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-11 13:22:32,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:22:32,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:22:32,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026695502] [2024-10-11 13:22:32,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026695502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:32,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:32,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:22:32,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437121540] [2024-10-11 13:22:32,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:32,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:22:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:22:32,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:22:32,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:22:32,427 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:22:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:32,492 INFO L93 Difference]: Finished difference Result 189 states and 274 transitions. [2024-10-11 13:22:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:22:32,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-11 13:22:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:32,494 INFO L225 Difference]: With dead ends: 189 [2024-10-11 13:22:32,494 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 13:22:32,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 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-10-11 13:22:32,496 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:32,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:22:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 13:22:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 13:22:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:22:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-11 13:22:32,512 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 145 [2024-10-11 13:22:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:32,514 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-11 13:22:32,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:22:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-11 13:22:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:22:32,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:32,516 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:32,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:22:32,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:32,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:32,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1848127975, now seen corresponding path program 1 times [2024-10-11 13:22:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:22:32,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568346795] [2024-10-11 13:22:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:22:32,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:22:32,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:22:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:32,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:22:32,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:22:33,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:22:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:33,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:22:33,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:22:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568346795] [2024-10-11 13:22:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568346795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:22:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767135807] [2024-10-11 13:22:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:22:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:22:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:22:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:22:33,348 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:22:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:33,683 INFO L93 Difference]: Finished difference Result 316 states and 454 transitions. [2024-10-11 13:22:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:22:33,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-11 13:22:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:33,689 INFO L225 Difference]: With dead ends: 316 [2024-10-11 13:22:33,689 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 13:22:33,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:22:33,691 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 196 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:33,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 489 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:22:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 13:22:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 191. [2024-10-11 13:22:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 148 states have internal predecessors, (194), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:22:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 274 transitions. [2024-10-11 13:22:33,736 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 274 transitions. Word has length 145 [2024-10-11 13:22:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:33,736 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 274 transitions. [2024-10-11 13:22:33,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:22:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 274 transitions. [2024-10-11 13:22:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 13:22:33,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:33,742 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:33,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:22:33,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:33,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash 152804667, now seen corresponding path program 1 times [2024-10-11 13:22:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:22:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026161917] [2024-10-11 13:22:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:33,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:22:33,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:22:33,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:22:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:34,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:22:34,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:22:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:22:34,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:22:34,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:22:34,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026161917] [2024-10-11 13:22:34,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026161917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:34,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:34,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:22:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318255578] [2024-10-11 13:22:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:34,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:22:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:22:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:22:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:22:34,236 INFO L87 Difference]: Start difference. First operand 191 states and 274 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:22:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:34,313 INFO L93 Difference]: Finished difference Result 395 states and 567 transitions. [2024-10-11 13:22:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:22:34,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-10-11 13:22:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:34,323 INFO L225 Difference]: With dead ends: 395 [2024-10-11 13:22:34,323 INFO L226 Difference]: Without dead ends: 205 [2024-10-11 13:22:34,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:22:34,325 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:34,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 617 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:22:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-11 13:22:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2024-10-11 13:22:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.2875) internal successors, (206), 160 states have internal predecessors, (206), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:22:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2024-10-11 13:22:34,354 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 153 [2024-10-11 13:22:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:34,355 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2024-10-11 13:22:34,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:22:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2024-10-11 13:22:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 13:22:34,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:34,359 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:34,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:22:34,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:34,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:34,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash 152864249, now seen corresponding path program 1 times [2024-10-11 13:22:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:22:34,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253368167] [2024-10-11 13:22:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:34,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:34,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:22:34,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:22:34,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:22:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:34,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:22:34,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:22:34,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:22:34,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 13:22:35,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-11 13:22:35,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-11 13:22:35,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:22:35,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-11 13:22:35,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:22:35,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 66 [2024-10-11 13:22:36,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:22:36,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 37 [2024-10-11 13:22:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 548 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-11 13:22:36,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:22:36,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:22:36,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253368167] [2024-10-11 13:22:36,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253368167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:22:36,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:22:36,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:22:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94759850] [2024-10-11 13:22:36,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:22:36,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:22:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:22:36,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:22:36,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:22:36,222 INFO L87 Difference]: Start difference. First operand 203 states and 286 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 13:22:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:22:38,219 INFO L93 Difference]: Finished difference Result 549 states and 767 transitions. [2024-10-11 13:22:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:22:38,220 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 153 [2024-10-11 13:22:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:22:38,223 INFO L225 Difference]: With dead ends: 549 [2024-10-11 13:22:38,223 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 13:22:38,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:22:38,225 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 270 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:22:38,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 717 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 13:22:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 13:22:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2024-10-11 13:22:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 284 states have (on average 1.2992957746478873) internal successors, (369), 286 states have internal predecessors, (369), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:22:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 477 transitions. [2024-10-11 13:22:38,279 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 477 transitions. Word has length 153 [2024-10-11 13:22:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:22:38,280 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 477 transitions. [2024-10-11 13:22:38,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 13:22:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 477 transitions. [2024-10-11 13:22:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 13:22:38,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:22:38,284 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:22:38,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 13:22:38,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:38,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:22:38,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:22:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash 535407572, now seen corresponding path program 1 times [2024-10-11 13:22:38,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:22:38,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513201634] [2024-10-11 13:22:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:22:38,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:22:38,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:22:38,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:22:38,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:22:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:22:38,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 13:22:38,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:22:38,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 13:22:39,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-10-11 13:22:39,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-11 13:22:39,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:22:39,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-11 13:22:39,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:22:39,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55