./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-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:30:36,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:30:36,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:30:36,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:30:36,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:30:36,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:30:36,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:30:36,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:30:36,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:30:36,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:30:36,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:30:36,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:30:36,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:30:36,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:30:36,529 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:30:36,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:30:36,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:30:36,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:30:36,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:30:36,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:30:36,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:30:36,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:30:36,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:30:36,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:30:36,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:30:36,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:30:36,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:30:36,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:30:36,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:30:36,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:30:36,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:30:36,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:30:36,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:30:36,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:30:36,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:30:36,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:30:36,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:30:36,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:30:36,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:30:36,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:30:36,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:30:36,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:30:36,542 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 [2024-10-14 13:30:36,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:30:36,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:30:36,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:30:36,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:30:36,837 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:30:36,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2024-10-14 13:30:38,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:30:38,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:30:38,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2024-10-14 13:30:38,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ad5b5a3/538b518b1f054ed39dea38ddfadc3bab/FLAG2f3f8e545 [2024-10-14 13:30:38,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ad5b5a3/538b518b1f054ed39dea38ddfadc3bab [2024-10-14 13:30:38,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:30:38,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:30:38,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:30:38,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:30:38,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:30:38,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ef52ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38, skipping insertion in model container [2024-10-14 13:30:38,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:30:38,725 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-96.i[916,929] [2024-10-14 13:30:38,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:30:38,809 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:30:38,825 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-96.i[916,929] [2024-10-14 13:30:38,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:30:38,894 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:30:38,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38 WrapperNode [2024-10-14 13:30:38,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:30:38,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:30:38,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:30:38,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:30:38,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:38,975 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2024-10-14 13:30:38,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:30:38,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:30:38,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:30:38,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:30:39,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,062 INFO L175 MemorySlicer]: Split 127 memory accesses to 7 slices as follows [2, 32, 25, 3, 9, 15, 41]. 32 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 3, 1, 2, 1, 3]. The 18 writes are split as follows [0, 6, 4, 1, 2, 1, 4]. [2024-10-14 13:30:39,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,100 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:30:39,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:30:39,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:30:39,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:30:39,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (1/1) ... [2024-10-14 13:30:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:30:39,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:30:39,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:30:39,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:30:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:30:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:30:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:30:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:30:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:30:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:30:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:30:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-14 13:30:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:30:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:30:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:30:39,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:30:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:30:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-14 13:30:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:30:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:30:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:30:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:30:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:30:39,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-14 13:30:39,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:30:39,237 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:30:39,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:30:39,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:30:39,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:30:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:30:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:30:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:30:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:30:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:30:39,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:30:39,409 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:30:39,411 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:30:39,987 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-14 13:30:39,987 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:30:40,022 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:30:40,023 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:30:40,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:40 BoogieIcfgContainer [2024-10-14 13:30:40,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:30:40,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:30:40,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:30:40,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:30:40,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:30:38" (1/3) ... [2024-10-14 13:30:40,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db08c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:30:40, skipping insertion in model container [2024-10-14 13:30:40,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:38" (2/3) ... [2024-10-14 13:30:40,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db08c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:30:40, skipping insertion in model container [2024-10-14 13:30:40,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:40" (3/3) ... [2024-10-14 13:30:40,032 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-96.i [2024-10-14 13:30:40,051 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:30:40,051 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:30:40,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:30:40,130 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;@5f498a9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:30:40,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:30:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:40,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:40,150 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:40,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:40,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash -625668829, now seen corresponding path program 1 times [2024-10-14 13:30:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:40,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554929269] [2024-10-14 13:30:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:40,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:40,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554929269] [2024-10-14 13:30:40,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554929269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:40,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:30:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985970847] [2024-10-14 13:30:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:40,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:30:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:40,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:30:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:30:40,706 INFO L87 Difference]: Start difference. First operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:40,758 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2024-10-14 13:30:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:30:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-14 13:30:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:40,774 INFO L225 Difference]: With dead ends: 199 [2024-10-14 13:30:40,774 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 13:30:40,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-14 13:30:40,784 INFO L432 NwaCegarLoop]: 143 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, 143 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-14 13:30:40,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 13:30:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 13:30:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2024-10-14 13:30:40,852 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 126 [2024-10-14 13:30:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:40,853 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2024-10-14 13:30:40,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2024-10-14 13:30:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:40,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:40,860 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:40,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:30:40,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:40,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:40,864 INFO L85 PathProgramCache]: Analyzing trace with hash 627711687, now seen corresponding path program 1 times [2024-10-14 13:30:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:40,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658647318] [2024-10-14 13:30:40,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:41,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:41,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658647318] [2024-10-14 13:30:41,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658647318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:41,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:41,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:30:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690005885] [2024-10-14 13:30:41,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:41,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:30:41,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:30:41,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:30:41,270 INFO L87 Difference]: Start difference. First operand 99 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:41,345 INFO L93 Difference]: Finished difference Result 200 states and 297 transitions. [2024-10-14 13:30:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:30:41,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:41,351 INFO L225 Difference]: With dead ends: 200 [2024-10-14 13:30:41,352 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 13:30:41,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-14 13:30:41,354 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:41,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 413 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 13:30:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-10-14 13:30:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2024-10-14 13:30:41,366 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 126 [2024-10-14 13:30:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:41,368 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2024-10-14 13:30:41,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2024-10-14 13:30:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:41,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:41,372 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:30:41,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -181634939, now seen corresponding path program 1 times [2024-10-14 13:30:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963227202] [2024-10-14 13:30:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:41,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:41,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963227202] [2024-10-14 13:30:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963227202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:41,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:41,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:30:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348978125] [2024-10-14 13:30:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:41,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:30:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:30:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:30:41,667 INFO L87 Difference]: Start difference. First operand 101 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:41,721 INFO L93 Difference]: Finished difference Result 204 states and 301 transitions. [2024-10-14 13:30:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:30:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:41,728 INFO L225 Difference]: With dead ends: 204 [2024-10-14 13:30:41,729 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 13:30:41,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-14 13:30:41,730 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:41,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 414 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 13:30:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-14 13:30:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-10-14 13:30:41,756 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 126 [2024-10-14 13:30:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:41,757 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-10-14 13:30:41,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-10-14 13:30:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:41,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:41,764 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:41,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:30:41,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:41,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:41,765 INFO L85 PathProgramCache]: Analyzing trace with hash -124376637, now seen corresponding path program 1 times [2024-10-14 13:30:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:41,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721389517] [2024-10-14 13:30:41,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:41,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721389517] [2024-10-14 13:30:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721389517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:41,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:30:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2498971] [2024-10-14 13:30:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:41,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:30:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:30:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:30:41,991 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:42,026 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2024-10-14 13:30:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:30:42,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:42,028 INFO L225 Difference]: With dead ends: 208 [2024-10-14 13:30:42,028 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 13:30:42,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-14 13:30:42,032 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:42,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 13:30:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-14 13:30:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-10-14 13:30:42,053 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 126 [2024-10-14 13:30:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:42,053 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-10-14 13:30:42,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-10-14 13:30:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:42,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:42,056 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:42,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:30:42,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:42,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash -124317055, now seen corresponding path program 1 times [2024-10-14 13:30:42,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090405891] [2024-10-14 13:30:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:42,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:42,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090405891] [2024-10-14 13:30:42,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090405891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:42,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:42,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:42,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661449311] [2024-10-14 13:30:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:42,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:30:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:30:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:42,351 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:42,418 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2024-10-14 13:30:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:30:42,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:42,420 INFO L225 Difference]: With dead ends: 211 [2024-10-14 13:30:42,420 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 13:30:42,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-14 13:30:42,422 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:42,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 536 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 13:30:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 13:30:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-10-14 13:30:42,430 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 126 [2024-10-14 13:30:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:42,431 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-10-14 13:30:42,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-10-14 13:30:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:42,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:42,433 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:42,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:30:42,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:42,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:42,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2118461761, now seen corresponding path program 1 times [2024-10-14 13:30:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:42,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415772399] [2024-10-14 13:30:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415772399] [2024-10-14 13:30:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415772399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:30:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73383508] [2024-10-14 13:30:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:30:43,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:43,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:30:43,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:30:43,494 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:43,795 INFO L93 Difference]: Finished difference Result 310 states and 449 transitions. [2024-10-14 13:30:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:30:43,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-14 13:30:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:43,798 INFO L225 Difference]: With dead ends: 310 [2024-10-14 13:30:43,798 INFO L226 Difference]: Without dead ends: 204 [2024-10-14 13:30:43,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:30:43,803 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 123 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:43,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 894 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:30:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-14 13:30:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2024-10-14 13:30:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 170 states have (on average 1.388235294117647) internal successors, (236), 171 states have internal predecessors, (236), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:30:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2024-10-14 13:30:43,838 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 126 [2024-10-14 13:30:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:43,839 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2024-10-14 13:30:43,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2024-10-14 13:30:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:30:43,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:43,841 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:43,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:30:43,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:43,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1464285444, now seen corresponding path program 1 times [2024-10-14 13:30:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:43,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499957148] [2024-10-14 13:30:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499957148] [2024-10-14 13:30:43,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499957148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:43,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:43,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:30:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724192721] [2024-10-14 13:30:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:43,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 13:30:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 13:30:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:30:43,980 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:44,021 INFO L93 Difference]: Finished difference Result 438 states and 633 transitions. [2024-10-14 13:30:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 13:30:44,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 13:30:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:44,025 INFO L225 Difference]: With dead ends: 438 [2024-10-14 13:30:44,026 INFO L226 Difference]: Without dead ends: 238 [2024-10-14 13:30:44,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:30:44,027 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 65 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:44,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 337 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-14 13:30:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 201. [2024-10-14 13:30:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 171 states have internal predecessors, (235), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:30:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 291 transitions. [2024-10-14 13:30:44,045 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 291 transitions. Word has length 128 [2024-10-14 13:30:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:44,046 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 291 transitions. [2024-10-14 13:30:44,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 291 transitions. [2024-10-14 13:30:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:30:44,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:44,048 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:44,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:30:44,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:44,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1273116639, now seen corresponding path program 1 times [2024-10-14 13:30:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615229443] [2024-10-14 13:30:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615229443] [2024-10-14 13:30:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615229443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:44,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:44,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443301511] [2024-10-14 13:30:44,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:44,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:30:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:44,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:30:44,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:44,261 INFO L87 Difference]: Start difference. First operand 201 states and 291 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:44,309 INFO L93 Difference]: Finished difference Result 407 states and 589 transitions. [2024-10-14 13:30:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:30:44,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 13:30:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:44,312 INFO L225 Difference]: With dead ends: 407 [2024-10-14 13:30:44,312 INFO L226 Difference]: Without dead ends: 207 [2024-10-14 13:30:44,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-14 13:30:44,314 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 549 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-14 13:30:44,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 549 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-14 13:30:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-10-14 13:30:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3693181818181819) internal successors, (241), 177 states have internal predecessors, (241), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:30:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2024-10-14 13:30:44,335 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 128 [2024-10-14 13:30:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:44,335 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2024-10-14 13:30:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2024-10-14 13:30:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:30:44,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:44,337 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:44,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:30:44,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:44,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash -247373434, now seen corresponding path program 1 times [2024-10-14 13:30:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:44,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019450873] [2024-10-14 13:30:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:44,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:44,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019450873] [2024-10-14 13:30:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019450873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:44,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:30:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239368001] [2024-10-14 13:30:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:44,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 13:30:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 13:30:44,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:30:44,455 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:44,487 INFO L93 Difference]: Finished difference Result 412 states and 589 transitions. [2024-10-14 13:30:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 13:30:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 13:30:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:44,491 INFO L225 Difference]: With dead ends: 412 [2024-10-14 13:30:44,491 INFO L226 Difference]: Without dead ends: 206 [2024-10-14 13:30:44,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:30:44,493 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 61 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:44,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 288 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-14 13:30:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-10-14 13:30:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 173 states have internal predecessors, (234), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:30:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2024-10-14 13:30:44,513 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 128 [2024-10-14 13:30:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:44,513 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2024-10-14 13:30:44,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2024-10-14 13:30:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 13:30:44,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:44,515 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:44,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 13:30:44,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:44,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1791080821, now seen corresponding path program 1 times [2024-10-14 13:30:44,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:44,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741070443] [2024-10-14 13:30:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:44,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741070443] [2024-10-14 13:30:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741070443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:44,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:30:44,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858625287] [2024-10-14 13:30:44,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:44,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:30:44,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:44,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:30:44,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:30:44,745 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:44,955 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2024-10-14 13:30:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:30:44,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-14 13:30:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:44,958 INFO L225 Difference]: With dead ends: 599 [2024-10-14 13:30:44,958 INFO L226 Difference]: Without dead ends: 397 [2024-10-14 13:30:44,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:44,960 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 237 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:44,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 381 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:30:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-14 13:30:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 341. [2024-10-14 13:30:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 280 states have (on average 1.3392857142857142) internal successors, (375), 282 states have internal predecessors, (375), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 13:30:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 487 transitions. [2024-10-14 13:30:44,997 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 487 transitions. Word has length 130 [2024-10-14 13:30:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:44,997 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 487 transitions. [2024-10-14 13:30:44,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 487 transitions. [2024-10-14 13:30:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:30:44,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:44,999 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:44,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:30:45,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:45,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -231422202, now seen corresponding path program 1 times [2024-10-14 13:30:45,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:45,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908224628] [2024-10-14 13:30:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:45,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:45,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908224628] [2024-10-14 13:30:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908224628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:45,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:45,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:30:45,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818233139] [2024-10-14 13:30:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:45,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:30:45,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:30:45,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:30:45,147 INFO L87 Difference]: Start difference. First operand 341 states and 487 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:45,219 INFO L93 Difference]: Finished difference Result 651 states and 926 transitions. [2024-10-14 13:30:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:30:45,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-10-14 13:30:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:45,226 INFO L225 Difference]: With dead ends: 651 [2024-10-14 13:30:45,227 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 13:30:45,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:45,229 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 58 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:45,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 411 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 13:30:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-10-14 13:30:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 282 states have (on average 1.3368794326241136) internal successors, (377), 284 states have internal predecessors, (377), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 13:30:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 489 transitions. [2024-10-14 13:30:45,262 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 489 transitions. Word has length 131 [2024-10-14 13:30:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:45,262 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 489 transitions. [2024-10-14 13:30:45,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 489 transitions. [2024-10-14 13:30:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:30:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:45,265 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:45,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:30:45,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1511285880, now seen corresponding path program 1 times [2024-10-14 13:30:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577001259] [2024-10-14 13:30:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:45,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:45,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577001259] [2024-10-14 13:30:45,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577001259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:45,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:45,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:30:45,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663288467] [2024-10-14 13:30:45,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:45,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:30:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:45,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:30:45,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:30:45,517 INFO L87 Difference]: Start difference. First operand 343 states and 489 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:45,592 INFO L93 Difference]: Finished difference Result 663 states and 940 transitions. [2024-10-14 13:30:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:30:45,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-10-14 13:30:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:45,595 INFO L225 Difference]: With dead ends: 663 [2024-10-14 13:30:45,596 INFO L226 Difference]: Without dead ends: 355 [2024-10-14 13:30:45,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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-14 13:30:45,597 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:45,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-14 13:30:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 346. [2024-10-14 13:30:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 285 states have (on average 1.3333333333333333) internal successors, (380), 287 states have internal predecessors, (380), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 13:30:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 492 transitions. [2024-10-14 13:30:45,626 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 492 transitions. Word has length 131 [2024-10-14 13:30:45,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:45,626 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 492 transitions. [2024-10-14 13:30:45,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 492 transitions. [2024-10-14 13:30:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:30:45,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:45,628 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:45,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:30:45,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:45,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1064892510, now seen corresponding path program 1 times [2024-10-14 13:30:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:45,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479676274] [2024-10-14 13:30:45,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:45,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:45,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479676274] [2024-10-14 13:30:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479676274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:45,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:45,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:45,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348899626] [2024-10-14 13:30:45,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:45,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:30:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:30:45,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:45,869 INFO L87 Difference]: Start difference. First operand 346 states and 492 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:46,026 INFO L93 Difference]: Finished difference Result 674 states and 956 transitions. [2024-10-14 13:30:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:30:46,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 13:30:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:46,029 INFO L225 Difference]: With dead ends: 674 [2024-10-14 13:30:46,029 INFO L226 Difference]: Without dead ends: 363 [2024-10-14 13:30:46,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-14 13:30:46,031 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 133 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:46,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 679 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:30:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-14 13:30:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2024-10-14 13:30:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 286 states have (on average 1.3111888111888113) internal successors, (375), 288 states have internal predecessors, (375), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 13:30:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 495 transitions. [2024-10-14 13:30:46,062 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 495 transitions. Word has length 132 [2024-10-14 13:30:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:46,063 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 495 transitions. [2024-10-14 13:30:46,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 495 transitions. [2024-10-14 13:30:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:30:46,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:46,065 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:46,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:30:46,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:46,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 478086496, now seen corresponding path program 1 times [2024-10-14 13:30:46,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:46,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128656863] [2024-10-14 13:30:46,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:46,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:30:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:30:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:30:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:30:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:30:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:30:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:30:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:30:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:30:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:30:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:30:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:30:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:30:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:30:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:30:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:30:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:30:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128656863] [2024-10-14 13:30:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128656863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:46,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472205145] [2024-10-14 13:30:46,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:46,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:30:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:30:46,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:30:46,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:46,504 INFO L87 Difference]: Start difference. First operand 352 states and 495 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:46,577 INFO L93 Difference]: Finished difference Result 372 states and 514 transitions. [2024-10-14 13:30:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:30:46,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 13:30:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:46,580 INFO L225 Difference]: With dead ends: 372 [2024-10-14 13:30:46,580 INFO L226 Difference]: Without dead ends: 370 [2024-10-14 13:30:46,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-14 13:30:46,581 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 89 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:46,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 637 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-14 13:30:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-10-14 13:30:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 301 states have (on average 1.2956810631229236) internal successors, (390), 303 states have internal predecessors, (390), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 13:30:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 510 transitions. [2024-10-14 13:30:46,616 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 510 transitions. Word has length 132 [2024-10-14 13:30:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:46,617 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 510 transitions. [2024-10-14 13:30:46,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 510 transitions. [2024-10-14 13:30:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:30:46,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:46,619 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 13:30:46,619 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:46,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash 478146078, now seen corresponding path program 1 times [2024-10-14 13:30:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:30:46,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175343044] [2024-10-14 13:30:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:46,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:30:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:30:46,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:30:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:30:46,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:30:46,833 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:30:46,834 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:30:46,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 13:30:46,841 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:46,954 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:30:46,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:30:46 BoogieIcfgContainer [2024-10-14 13:30:46,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:30:46,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:30:46,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:30:46,959 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:30:46,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:40" (3/4) ... [2024-10-14 13:30:46,961 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:30:46,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:30:46,963 INFO L158 Benchmark]: Toolchain (without parser) took 8426.96ms. Allocated memory was 167.8MB in the beginning and 331.4MB in the end (delta: 163.6MB). Free memory was 111.5MB in the beginning and 269.8MB in the end (delta: -158.3MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-10-14 13:30:46,963 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:30:46,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.72ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 95.8MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 13:30:46,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.28ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 91.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:30:46,964 INFO L158 Benchmark]: Boogie Preprocessor took 152.52ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 85.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 13:30:46,964 INFO L158 Benchmark]: RCFGBuilder took 888.38ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 103.8MB in the end (delta: -17.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-14 13:30:46,965 INFO L158 Benchmark]: TraceAbstraction took 6932.36ms. Allocated memory was 167.8MB in the beginning and 331.4MB in the end (delta: 163.6MB). Free memory was 102.5MB in the beginning and 270.8MB in the end (delta: -168.3MB). Peak memory consumption was 163.9MB. Max. memory is 16.1GB. [2024-10-14 13:30:46,965 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 331.4MB. Free memory was 270.8MB in the beginning and 269.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:30:46,967 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.21ms. Allocated memory is still 167.8MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.72ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 95.8MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.28ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 91.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 152.52ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 85.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 888.38ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 103.8MB in the end (delta: -17.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6932.36ms. Allocated memory was 167.8MB in the beginning and 331.4MB in the end (delta: 163.6MB). Free memory was 102.5MB in the beginning and 270.8MB in the end (delta: -168.3MB). Peak memory consumption was 163.9MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 331.4MB. Free memory was 270.8MB in the beginning and 269.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 1, 0 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L25-L27] double double_Array_0[3] = { 2.75, 4.575, 128.5 }; [L28-L30] float float_Array_0[1] = { 99999.25 }; [L28-L30] float float_Array_0[1] = { 99999.25 }; [L31-L33] signed char signed_char_Array_0[2] = { 1, 50 }; [L31-L33] signed char signed_char_Array_0[2] = { 1, 50 }; [L31-L33] signed char signed_char_Array_0[2] = { 1, 50 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -1000000000 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -1000000000 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 1000, 8, 8 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_3_ = 1; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR BOOL_unsigned_char_Array_0[3] [L98] last_1_BOOL_unsigned_char_Array_0_3_ = BOOL_unsigned_char_Array_0[3] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] double_Array_0[0] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR (double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not((double_Array_0[0] >= -461168.6018427382800e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] double_Array_0[2] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[2] [L86] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F [L86] EXPR double_Array_0[2] [L86] EXPR double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR (double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[2] >= -461168.6018427382800e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L94] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L44] COND FALSE !(! last_1_BOOL_unsigned_char_Array_0_3_) [L47] EXPR unsigned_short_int_Array_0[0] [L47] unsigned_short_int_Array_0[2] = unsigned_short_int_Array_0[0] [L49] EXPR BOOL_unsigned_char_Array_0[2] [L49] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[2]; [L50] BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] COND FALSE !(BOOL_unsigned_char_Array_0[4]) [L59] EXPR unsigned_short_int_Array_0[2] [L59] signed_long_int_Array_0[0] = unsigned_short_int_Array_0[2] [L60] EXPR double_Array_0[0] [L60] float_Array_0[0] = double_Array_0[0] [L61] EXPR signed_char_Array_0[1] [L61] signed_char_Array_0[0] = signed_char_Array_0[1] [L62] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L62] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L62] EXPR signed_long_int_Array_0[0] [L62] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_0=257, unsigned_short_int_Array_0={9:0}] [L62] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L62] COND FALSE !(((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR (! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L101] EXPR unsigned_short_int_Array_0[2] [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR (! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1) [L101] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1 [L101] EXPR BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1) [L101] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1 [L101] EXPR (((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2])) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR unsigned_short_int_Array_0[2] [L101] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0])) [L101] EXPR float_Array_0[0] [L101] EXPR double_Array_0[0] [L101] EXPR (((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101-L102] return ((((((! last_1_BOOL_unsigned_char_Array_0_3_) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[0]))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) && (BOOL_unsigned_char_Array_0[4] ? ((BOOL_unsigned_char_Array_0[2] && ((unsigned_short_int_Array_0[1] >= 16) || last_1_BOOL_unsigned_char_Array_0_3_)) ? (BOOL_unsigned_char_Array_0[2] ? (BOOL_unsigned_char_Array_0[3] == ((unsigned char) ((unsigned_short_int_Array_0[2] < unsigned_short_int_Array_0[2]) && BOOL_unsigned_char_Array_0[0]))) : (BOOL_unsigned_char_Array_0[3] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) : 1) : 1)) && ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) > signed_long_int_Array_0[0]) ? (((signed_long_int_Array_0[0] / -5) >= ((unsigned_short_int_Array_0[0] + signed_long_int_Array_0[0]) - ((((unsigned_short_int_Array_0[2]) < (unsigned_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2]) : (unsigned_short_int_Array_0[1]))))) ? (double_Array_0[1] == ((double) (double_Array_0[0] + double_Array_0[2]))) : (double_Array_0[1] == ((double) double_Array_0[2]))) : 1)) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[2]))) && (float_Array_0[0] == ((float) double_Array_0[0]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_3_=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 15, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 771 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 770 mSDsluCounter, 6781 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4576 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 2205 mSDtfsCounter, 629 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 541 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=14, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1928 NumberOfCodeBlocks, 1928 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1782 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6720/6720 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-14 13:30:47,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:30:49,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:30:49,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:30:49,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:30:49,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:30:49,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:30:49,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:30:49,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:30:49,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:30:49,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:30:49,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:30:49,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:30:49,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:30:49,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:30:49,416 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:30:49,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:30:49,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:30:49,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:30:49,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:30:49,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:30:49,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:30:49,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:30:49,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:30:49,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:30:49,422 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:30:49,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:30:49,422 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:30:49,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:30:49,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:30:49,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:30:49,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:30:49,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:30:49,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:30:49,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:30:49,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:30:49,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:30:49,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:30:49,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:30:49,429 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:30:49,430 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:30:49,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:30:49,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:30:49,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:30:49,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:30:49,432 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:30:49,432 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdbb2557d13c4ebf5afc59b31f2554eb4dac84eb5f5361696929e0578cc40049 [2024-10-14 13:30:49,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:30:49,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:30:49,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:30:49,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:30:49,833 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:30:49,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2024-10-14 13:30:51,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:30:51,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:30:51,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-96.i [2024-10-14 13:30:51,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a53dc30/ed376036cf974ec983b4050c5aa112f2/FLAG9bb278a73 [2024-10-14 13:30:52,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a53dc30/ed376036cf974ec983b4050c5aa112f2 [2024-10-14 13:30:52,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:30:52,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:30:52,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:30:52,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:30:52,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:30:52,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618bf458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52, skipping insertion in model container [2024-10-14 13:30:52,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:30:52,239 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-96.i[916,929] [2024-10-14 13:30:52,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:30:52,320 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:30:52,330 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-96.i[916,929] [2024-10-14 13:30:52,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:30:52,414 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:30:52,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52 WrapperNode [2024-10-14 13:30:52,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:30:52,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:30:52,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:30:52,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:30:52,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,485 INFO L138 Inliner]: procedures = 39, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2024-10-14 13:30:52,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:30:52,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:30:52,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:30:52,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:30:52,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,541 INFO L175 MemorySlicer]: Split 127 memory accesses to 7 slices as follows [2, 32, 25, 3, 9, 15, 41]. 32 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 3, 1, 2, 1, 3]. The 18 writes are split as follows [0, 6, 4, 1, 2, 1, 4]. [2024-10-14 13:30:52,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:30:52,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:30:52,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:30:52,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:30:52,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (1/1) ... [2024-10-14 13:30:52,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:30:52,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:30:52,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:30:52,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:30:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:30:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 13:30:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 13:30:52,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-14 13:30:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-14 13:30:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-14 13:30:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-14 13:30:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-14 13:30:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 13:30:52,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 13:30:52,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-14 13:30:52,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-14 13:30:52,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 13:30:52,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-14 13:30:52,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 13:30:52,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:30:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-14 13:30:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-14 13:30:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:30:52,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:30:52,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-14 13:30:52,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-14 13:30:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-14 13:30:52,894 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:30:52,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:30:54,096 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-14 13:30:54,096 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:30:54,168 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:30:54,168 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:30:54,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:54 BoogieIcfgContainer [2024-10-14 13:30:54,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:30:54,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:30:54,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:30:54,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:30:54,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:30:52" (1/3) ... [2024-10-14 13:30:54,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ea8314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:30:54, skipping insertion in model container [2024-10-14 13:30:54,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:30:52" (2/3) ... [2024-10-14 13:30:54,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ea8314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:30:54, skipping insertion in model container [2024-10-14 13:30:54,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:30:54" (3/3) ... [2024-10-14 13:30:54,183 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-96.i [2024-10-14 13:30:54,206 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:30:54,207 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:30:54,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:30:54,298 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;@2cd00c60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:30:54,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:30:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:54,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:54,314 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:54,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash -625668829, now seen corresponding path program 1 times [2024-10-14 13:30:54,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:54,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187259511] [2024-10-14 13:30:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:54,332 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-14 13:30:54,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:54,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:30:54,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 13:30:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:54,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:30:54,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-14 13:30:54,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:54,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:54,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187259511] [2024-10-14 13:30:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187259511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:54,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:30:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981241796] [2024-10-14 13:30:54,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:54,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:30:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:30:54,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:30:54,838 INFO L87 Difference]: Start difference. First operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:54,896 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2024-10-14 13:30:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:30:54,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-14 13:30:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:54,910 INFO L225 Difference]: With dead ends: 199 [2024-10-14 13:30:54,910 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 13:30:54,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-14 13:30:54,918 INFO L432 NwaCegarLoop]: 143 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, 143 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-14 13:30:54,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 13:30:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 13:30:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2024-10-14 13:30:54,961 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 126 [2024-10-14 13:30:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:54,962 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2024-10-14 13:30:54,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:30:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2024-10-14 13:30:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:54,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:54,965 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:54,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 13:30:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:30:55,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:55,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash 627711687, now seen corresponding path program 1 times [2024-10-14 13:30:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690005163] [2024-10-14 13:30:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:55,169 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-14 13:30:55,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:55,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:30:55,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 13:30:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:55,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:30:55,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:55,582 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 11 treesize of output 5 [2024-10-14 13:30:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:55,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:55,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690005163] [2024-10-14 13:30:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690005163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:55,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:55,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:30:55,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707794095] [2024-10-14 13:30:55,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:55,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 13:30:55,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:55,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 13:30:55,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:30:55,605 INFO L87 Difference]: Start difference. First operand 99 states and 147 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:55,667 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2024-10-14 13:30:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 13:30:55,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:55,670 INFO L225 Difference]: With dead ends: 197 [2024-10-14 13:30:55,670 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 13:30:55,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:30:55,672 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:55,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:30:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 13:30:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 13:30:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2024-10-14 13:30:55,684 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 126 [2024-10-14 13:30:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:55,689 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2024-10-14 13:30:55,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2024-10-14 13:30:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:55,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:55,693 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:55,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 13:30:55,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:30:55,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:55,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1366433019, now seen corresponding path program 1 times [2024-10-14 13:30:55,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72316813] [2024-10-14 13:30:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:55,896 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-14 13:30:55,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:55,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:30:55,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 13:30:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:56,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:30:56,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:56,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:56,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72316813] [2024-10-14 13:30:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72316813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:30:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915363293] [2024-10-14 13:30:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:30:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:56,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:30:56,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:30:56,319 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:56,443 INFO L93 Difference]: Finished difference Result 202 states and 298 transitions. [2024-10-14 13:30:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:30:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:56,448 INFO L225 Difference]: With dead ends: 202 [2024-10-14 13:30:56,448 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 13:30:56,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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-14 13:30:56,483 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:56,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 538 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:30:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 13:30:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-14 13:30:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-10-14 13:30:56,513 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 126 [2024-10-14 13:30:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:56,514 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-10-14 13:30:56,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-10-14 13:30:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:56,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:56,521 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:56,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 13:30:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:30:56,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2119187651, now seen corresponding path program 1 times [2024-10-14 13:30:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:56,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341546773] [2024-10-14 13:30:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:56,724 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-14 13:30:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:56,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:30:56,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 13:30:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:57,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 13:30:57,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:57,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:57,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:57,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341546773] [2024-10-14 13:30:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341546773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:57,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:57,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:30:57,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286048394] [2024-10-14 13:30:57,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:57,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:30:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:57,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:30:57,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:30:57,079 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:57,249 INFO L93 Difference]: Finished difference Result 208 states and 303 transitions. [2024-10-14 13:30:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:30:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:57,251 INFO L225 Difference]: With dead ends: 208 [2024-10-14 13:30:57,252 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 13:30:57,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 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-14 13:30:57,255 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:57,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 663 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:30:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 13:30:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-14 13:30:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2024-10-14 13:30:57,265 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 126 [2024-10-14 13:30:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:57,265 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2024-10-14 13:30:57,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2024-10-14 13:30:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:57,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:57,267 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:57,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 13:30:57,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:30:57,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:57,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2118521343, now seen corresponding path program 1 times [2024-10-14 13:30:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503443753] [2024-10-14 13:30:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:57,474 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-14 13:30:57,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:57,478 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:30:57,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 13:30:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:57,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 13:30:57,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:30:57,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:57,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503443753] [2024-10-14 13:30:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503443753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:57,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:30:57,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732019992] [2024-10-14 13:30:57,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:57,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:30:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:57,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:30:57,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:30:57,869 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:30:58,246 INFO L93 Difference]: Finished difference Result 212 states and 307 transitions. [2024-10-14 13:30:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:30:58,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 13:30:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:30:58,249 INFO L225 Difference]: With dead ends: 212 [2024-10-14 13:30:58,249 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 13:30:58,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:30:58,251 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:30:58,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 790 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:30:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 13:30:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 13:30:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:30:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-10-14 13:30:58,259 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 126 [2024-10-14 13:30:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:30:58,260 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-10-14 13:30:58,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:30:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-10-14 13:30:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 13:30:58,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:30:58,262 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:30:58,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 13:30:58,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:30:58,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:30:58,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:30:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2118461761, now seen corresponding path program 1 times [2024-10-14 13:30:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:30:58,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855523502] [2024-10-14 13:30:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:30:58,468 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-14 13:30:58,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:30:58,471 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:30:58,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 13:30:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:30:58,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 13:30:58,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:30:58,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-14 13:30:59,044 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 23 treesize of output 22 [2024-10-14 13:30:59,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:30:59,245 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 38 treesize of output 36 [2024-10-14 13:30:59,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:30:59,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 75 treesize of output 39 [2024-10-14 13:30:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-14 13:30:59,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:30:59,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:30:59,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855523502] [2024-10-14 13:30:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855523502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:30:59,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:30:59,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:30:59,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805963413] [2024-10-14 13:30:59,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:30:59,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:30:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:30:59,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:30:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:30:59,560 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-14 13:31:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:00,397 INFO L93 Difference]: Finished difference Result 310 states and 446 transitions. [2024-10-14 13:31:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:31:00,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 126 [2024-10-14 13:31:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:00,400 INFO L225 Difference]: With dead ends: 310 [2024-10-14 13:31:00,400 INFO L226 Difference]: Without dead ends: 204 [2024-10-14 13:31:00,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:31:00,401 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 254 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:00,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 623 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 13:31:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-14 13:31:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2024-10-14 13:31:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 170 states have (on average 1.3764705882352941) internal successors, (234), 171 states have internal predecessors, (234), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:31:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 290 transitions. [2024-10-14 13:31:00,430 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 290 transitions. Word has length 126 [2024-10-14 13:31:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:00,430 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 290 transitions. [2024-10-14 13:31:00,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-14 13:31:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 290 transitions. [2024-10-14 13:31:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:31:00,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:00,432 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:00,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 13:31:00,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:00,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:00,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1464285444, now seen corresponding path program 1 times [2024-10-14 13:31:00,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:00,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829784146] [2024-10-14 13:31:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:00,635 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-14 13:31:00,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:00,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:00,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 13:31:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:00,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:31:00,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:00,915 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 21 treesize of output 9 [2024-10-14 13:31:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:01,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:01,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:01,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829784146] [2024-10-14 13:31:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829784146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:31:01,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566462159] [2024-10-14 13:31:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:01,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:31:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:01,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:31:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:31:01,174 INFO L87 Difference]: Start difference. First operand 201 states and 290 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:01,462 INFO L93 Difference]: Finished difference Result 585 states and 841 transitions. [2024-10-14 13:31:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:31:01,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 13:31:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:01,467 INFO L225 Difference]: With dead ends: 585 [2024-10-14 13:31:01,467 INFO L226 Difference]: Without dead ends: 385 [2024-10-14 13:31:01,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:31:01,468 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 231 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:01,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 378 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:31:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-14 13:31:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 345. [2024-10-14 13:31:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 284 states have (on average 1.3556338028169015) internal successors, (385), 286 states have internal predecessors, (385), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 13:31:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 497 transitions. [2024-10-14 13:31:01,532 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 497 transitions. Word has length 128 [2024-10-14 13:31:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:01,533 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 497 transitions. [2024-10-14 13:31:01,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 497 transitions. [2024-10-14 13:31:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 13:31:01,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:01,535 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:01,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 13:31:01,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:01,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:01,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1273116639, now seen corresponding path program 1 times [2024-10-14 13:31:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:01,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664892119] [2024-10-14 13:31:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:01,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:01,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:01,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:01,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 13:31:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:02,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:31:02,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:02,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:02,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664892119] [2024-10-14 13:31:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664892119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:02,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:02,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:31:02,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4060745] [2024-10-14 13:31:02,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:02,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:31:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:31:02,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:31:02,053 INFO L87 Difference]: Start difference. First operand 345 states and 497 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:02,132 INFO L93 Difference]: Finished difference Result 664 states and 953 transitions. [2024-10-14 13:31:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:31:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 13:31:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:02,143 INFO L225 Difference]: With dead ends: 664 [2024-10-14 13:31:02,143 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 13:31:02,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 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-14 13:31:02,144 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:02,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:31:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 13:31:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-14 13:31:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 293 states have (on average 1.3447098976109215) internal successors, (394), 295 states have internal predecessors, (394), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 13:31:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 506 transitions. [2024-10-14 13:31:02,176 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 506 transitions. Word has length 128 [2024-10-14 13:31:02,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:02,177 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 506 transitions. [2024-10-14 13:31:02,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 506 transitions. [2024-10-14 13:31:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 13:31:02,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:02,179 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:02,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 13:31:02,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:02,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:02,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash -231422202, now seen corresponding path program 1 times [2024-10-14 13:31:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278148709] [2024-10-14 13:31:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:02,381 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-14 13:31:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:02,384 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:02,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 13:31:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:02,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:31:02,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-10-14 13:31:03,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:31:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:03,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:03,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278148709] [2024-10-14 13:31:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278148709] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:31:03,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:31:03,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-14 13:31:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188676867] [2024-10-14 13:31:03,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:03,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:31:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:31:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:31:03,195 INFO L87 Difference]: Start difference. First operand 354 states and 506 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:03,417 INFO L93 Difference]: Finished difference Result 846 states and 1187 transitions. [2024-10-14 13:31:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:31:03,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-10-14 13:31:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:03,422 INFO L225 Difference]: With dead ends: 846 [2024-10-14 13:31:03,422 INFO L226 Difference]: Without dead ends: 527 [2024-10-14 13:31:03,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:31:03,424 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 106 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:03,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 385 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:31:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-14 13:31:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 522. [2024-10-14 13:31:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 439 states have (on average 1.3189066059225512) internal successors, (579), 444 states have internal predecessors, (579), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-14 13:31:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 727 transitions. [2024-10-14 13:31:03,481 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 727 transitions. Word has length 131 [2024-10-14 13:31:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 727 transitions. [2024-10-14 13:31:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 727 transitions. [2024-10-14 13:31:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:31:03,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:03,483 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:03,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 13:31:03,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:03,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1064892510, now seen corresponding path program 1 times [2024-10-14 13:31:03,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854222281] [2024-10-14 13:31:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:03,684 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-14 13:31:03,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:03,685 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:03,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 13:31:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:03,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:31:03,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:03,982 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 19 treesize of output 13 [2024-10-14 13:31:03,987 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 13 treesize of output 9 [2024-10-14 13:31:04,050 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-14 13:31:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:04,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:04,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854222281] [2024-10-14 13:31:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854222281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:31:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698751265] [2024-10-14 13:31:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:31:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:31:04,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:31:04,073 INFO L87 Difference]: Start difference. First operand 522 states and 727 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:04,280 INFO L93 Difference]: Finished difference Result 1029 states and 1430 transitions. [2024-10-14 13:31:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:31:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 13:31:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:04,293 INFO L225 Difference]: With dead ends: 1029 [2024-10-14 13:31:04,293 INFO L226 Difference]: Without dead ends: 546 [2024-10-14 13:31:04,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:31:04,296 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 133 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:04,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 502 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:31:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-14 13:31:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 534. [2024-10-14 13:31:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 446 states have (on average 1.3004484304932735) internal successors, (580), 451 states have internal predecessors, (580), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 13:31:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 736 transitions. [2024-10-14 13:31:04,347 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 736 transitions. Word has length 132 [2024-10-14 13:31:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:04,348 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 736 transitions. [2024-10-14 13:31:04,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 736 transitions. [2024-10-14 13:31:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:31:04,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:04,349 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:04,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 13:31:04,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:04,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:04,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash 478086496, now seen corresponding path program 1 times [2024-10-14 13:31:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:04,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686375740] [2024-10-14 13:31:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:04,551 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-14 13:31:04,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:04,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:04,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 13:31:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:04,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 13:31:04,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:04,966 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-14 13:31:05,138 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 23 [2024-10-14 13:31:05,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:31:05,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 31 [2024-10-14 13:31:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-14 13:31:05,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:05,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686375740] [2024-10-14 13:31:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686375740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:31:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044843306] [2024-10-14 13:31:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:05,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:31:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:05,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:31:05,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:31:05,389 INFO L87 Difference]: Start difference. First operand 534 states and 736 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:31:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:05,764 INFO L93 Difference]: Finished difference Result 560 states and 764 transitions. [2024-10-14 13:31:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:31:05,765 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), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2024-10-14 13:31:05,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:05,768 INFO L225 Difference]: With dead ends: 560 [2024-10-14 13:31:05,769 INFO L226 Difference]: Without dead ends: 558 [2024-10-14 13:31:05,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:31:05,770 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 189 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:05,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 596 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:31:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-10-14 13:31:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2024-10-14 13:31:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 467 states have (on average 1.2869379014989293) internal successors, (601), 472 states have internal predecessors, (601), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-14 13:31:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 757 transitions. [2024-10-14 13:31:05,822 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 757 transitions. Word has length 132 [2024-10-14 13:31:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:05,823 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 757 transitions. [2024-10-14 13:31:05,823 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), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:31:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 757 transitions. [2024-10-14 13:31:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:31:05,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:05,825 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:05,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-14 13:31:06,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:06,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:06,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash 478146078, now seen corresponding path program 1 times [2024-10-14 13:31:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:06,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110865468] [2024-10-14 13:31:06,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:06,027 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-14 13:31:06,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:06,028 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:06,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 13:31:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:06,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 13:31:06,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:06,580 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 8 treesize of output 1 [2024-10-14 13:31:07,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:31:07,135 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 131 treesize of output 57 [2024-10-14 13:31:08,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:31:17,017 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 203 treesize of output 167 [2024-10-14 13:31:17,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:31:17,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 117 [2024-10-14 13:31:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-14 13:31:17,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:17,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:17,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110865468] [2024-10-14 13:31:17,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110865468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:17,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:17,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:31:17,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935923915] [2024-10-14 13:31:17,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:17,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 13:31:17,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:17,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 13:31:17,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:31:17,780 INFO L87 Difference]: Start difference. First operand 558 states and 757 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:31:24,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 13:31:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:35,761 INFO L93 Difference]: Finished difference Result 1944 states and 2613 transitions. [2024-10-14 13:31:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 13:31:35,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2024-10-14 13:31:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:35,779 INFO L225 Difference]: With dead ends: 1944 [2024-10-14 13:31:35,779 INFO L226 Difference]: Without dead ends: 1437 [2024-10-14 13:31:35,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:31:35,782 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 323 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:35,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 984 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 15.0s Time] [2024-10-14 13:31:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-10-14 13:31:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1427. [2024-10-14 13:31:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1207 states have (on average 1.2700911350455675) internal successors, (1533), 1226 states have internal predecessors, (1533), 190 states have call successors, (190), 29 states have call predecessors, (190), 29 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-14 13:31:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1913 transitions. [2024-10-14 13:31:35,934 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1913 transitions. Word has length 132 [2024-10-14 13:31:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:35,934 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1913 transitions. [2024-10-14 13:31:35,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:31:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1913 transitions. [2024-10-14 13:31:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:31:35,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:35,937 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:35,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-14 13:31:36,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:36,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:36,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash 535404380, now seen corresponding path program 1 times [2024-10-14 13:31:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:36,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323860568] [2024-10-14 13:31:36,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:36,139 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-14 13:31:36,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:36,142 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:36,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 13:31:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:36,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 13:31:36,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:36,409 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 15 [2024-10-14 13:31:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:36,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:36,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323860568] [2024-10-14 13:31:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323860568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:36,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:36,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:31:36,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694421899] [2024-10-14 13:31:36,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:36,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:31:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:36,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:31:36,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:31:36,498 INFO L87 Difference]: Start difference. First operand 1427 states and 1913 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:37,294 INFO L93 Difference]: Finished difference Result 2781 states and 3722 transitions. [2024-10-14 13:31:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:31:37,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 13:31:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:37,302 INFO L225 Difference]: With dead ends: 2781 [2024-10-14 13:31:37,303 INFO L226 Difference]: Without dead ends: 1431 [2024-10-14 13:31:37,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:31:37,307 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 112 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:37,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 603 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:31:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-10-14 13:31:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1427. [2024-10-14 13:31:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1207 states have (on average 1.2551781275890639) internal successors, (1515), 1226 states have internal predecessors, (1515), 190 states have call successors, (190), 29 states have call predecessors, (190), 29 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-14 13:31:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1895 transitions. [2024-10-14 13:31:37,459 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1895 transitions. Word has length 132 [2024-10-14 13:31:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:37,460 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1895 transitions. [2024-10-14 13:31:37,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1895 transitions. [2024-10-14 13:31:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:31:37,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:37,462 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:37,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 13:31:37,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:37,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:37,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:37,664 INFO L85 PathProgramCache]: Analyzing trace with hash -273942246, now seen corresponding path program 1 times [2024-10-14 13:31:37,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:37,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781815298] [2024-10-14 13:31:37,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:37,665 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-14 13:31:37,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:37,668 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:37,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 13:31:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:37,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:31:37,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:37,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:37,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:37,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781815298] [2024-10-14 13:31:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781815298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:37,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:37,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:31:37,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346942115] [2024-10-14 13:31:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:37,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:31:37,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:31:37,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:31:37,992 INFO L87 Difference]: Start difference. First operand 1427 states and 1895 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:38,228 INFO L93 Difference]: Finished difference Result 2831 states and 3754 transitions. [2024-10-14 13:31:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:31:38,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 13:31:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:38,236 INFO L225 Difference]: With dead ends: 2831 [2024-10-14 13:31:38,236 INFO L226 Difference]: Without dead ends: 1481 [2024-10-14 13:31:38,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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-14 13:31:38,241 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:38,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 542 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:31:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2024-10-14 13:31:38,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2024-10-14 13:31:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1261 states have (on average 1.2442505947660587) internal successors, (1569), 1280 states have internal predecessors, (1569), 190 states have call successors, (190), 29 states have call predecessors, (190), 29 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-14 13:31:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1949 transitions. [2024-10-14 13:31:38,387 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1949 transitions. Word has length 132 [2024-10-14 13:31:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:38,388 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 1949 transitions. [2024-10-14 13:31:38,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1949 transitions. [2024-10-14 13:31:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 13:31:38,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:38,390 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:38,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-14 13:31:38,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:38,591 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:38,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2044904028, now seen corresponding path program 1 times [2024-10-14 13:31:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:38,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458316350] [2024-10-14 13:31:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:38,592 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-14 13:31:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:38,594 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:38,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 13:31:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:38,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:31:38,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-14 13:31:38,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:38,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458316350] [2024-10-14 13:31:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458316350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:38,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:38,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:31:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146975364] [2024-10-14 13:31:38,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:38,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:31:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:38,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:31:38,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:31:38,913 INFO L87 Difference]: Start difference. First operand 1481 states and 1949 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:31:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:39,225 INFO L93 Difference]: Finished difference Result 2909 states and 3824 transitions. [2024-10-14 13:31:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:31:39,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2024-10-14 13:31:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:39,233 INFO L225 Difference]: With dead ends: 2909 [2024-10-14 13:31:39,233 INFO L226 Difference]: Without dead ends: 1481 [2024-10-14 13:31:39,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 129 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-14 13:31:39,238 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:39,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:31:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2024-10-14 13:31:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2024-10-14 13:31:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1261 states have (on average 1.2410785091197463) internal successors, (1565), 1280 states have internal predecessors, (1565), 190 states have call successors, (190), 29 states have call predecessors, (190), 29 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-14 13:31:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1945 transitions. [2024-10-14 13:31:39,407 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1945 transitions. Word has length 132 [2024-10-14 13:31:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:39,407 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 1945 transitions. [2024-10-14 13:31:39,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 13:31:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1945 transitions. [2024-10-14 13:31:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:31:39,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:39,411 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:39,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 13:31:39,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:39,612 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:39,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1860815968, now seen corresponding path program 1 times [2024-10-14 13:31:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417446712] [2024-10-14 13:31:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:39,613 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-14 13:31:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:39,615 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:39,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 13:31:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:39,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:31:39,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:39,908 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 21 treesize of output 9 [2024-10-14 13:31:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:40,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:40,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417446712] [2024-10-14 13:31:40,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417446712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:40,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:40,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:31:40,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047208565] [2024-10-14 13:31:40,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:40,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:31:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:40,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:31:40,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:31:40,324 INFO L87 Difference]: Start difference. First operand 1481 states and 1945 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:40,827 INFO L93 Difference]: Finished difference Result 3023 states and 3956 transitions. [2024-10-14 13:31:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:31:40,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-10-14 13:31:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:40,834 INFO L225 Difference]: With dead ends: 3023 [2024-10-14 13:31:40,835 INFO L226 Difference]: Without dead ends: 1619 [2024-10-14 13:31:40,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 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-14 13:31:40,838 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 227 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:40,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 490 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:31:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2024-10-14 13:31:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1483. [2024-10-14 13:31:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1263 states have (on average 1.2406967537608868) internal successors, (1567), 1282 states have internal predecessors, (1567), 190 states have call successors, (190), 29 states have call predecessors, (190), 29 states have return successors, (190), 171 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-14 13:31:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1947 transitions. [2024-10-14 13:31:40,978 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1947 transitions. Word has length 133 [2024-10-14 13:31:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:40,978 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 1947 transitions. [2024-10-14 13:31:40,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1947 transitions. [2024-10-14 13:31:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:31:40,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:40,981 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:40,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 13:31:41,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:41,181 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:41,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:41,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1922855582, now seen corresponding path program 1 times [2024-10-14 13:31:41,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:41,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726888163] [2024-10-14 13:31:41,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:41,183 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-14 13:31:41,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:41,186 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:41,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 13:31:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:41,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 13:31:41,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:41,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:41,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726888163] [2024-10-14 13:31:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726888163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:41,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:31:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727886432] [2024-10-14 13:31:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:41,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:31:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:41,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:31:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:31:41,694 INFO L87 Difference]: Start difference. First operand 1483 states and 1947 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:42,335 INFO L93 Difference]: Finished difference Result 3283 states and 4286 transitions. [2024-10-14 13:31:42,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:31:42,336 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-10-14 13:31:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:42,346 INFO L225 Difference]: With dead ends: 3283 [2024-10-14 13:31:42,347 INFO L226 Difference]: Without dead ends: 1877 [2024-10-14 13:31:42,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:31:42,352 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 67 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:42,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 736 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:31:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-14 13:31:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1869. [2024-10-14 13:31:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1615 states have (on average 1.226625386996904) internal successors, (1981), 1640 states have internal predecessors, (1981), 214 states have call successors, (214), 39 states have call predecessors, (214), 39 states have return successors, (214), 189 states have call predecessors, (214), 214 states have call successors, (214) [2024-10-14 13:31:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2409 transitions. [2024-10-14 13:31:42,516 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2409 transitions. Word has length 133 [2024-10-14 13:31:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:42,517 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2409 transitions. [2024-10-14 13:31:42,517 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2409 transitions. [2024-10-14 13:31:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 13:31:42,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:42,519 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:42,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-14 13:31:42,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:42,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:42,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash 642991904, now seen corresponding path program 1 times [2024-10-14 13:31:42,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:42,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964499765] [2024-10-14 13:31:42,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:42,722 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-14 13:31:42,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:42,725 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:42,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 13:31:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:42,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 13:31:42,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:43,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:43,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:43,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964499765] [2024-10-14 13:31:43,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964499765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:43,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:43,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:31:43,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403530028] [2024-10-14 13:31:43,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:43,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:31:43,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:31:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:31:43,054 INFO L87 Difference]: Start difference. First operand 1869 states and 2409 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:43,317 INFO L93 Difference]: Finished difference Result 3675 states and 4732 transitions. [2024-10-14 13:31:43,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:31:43,318 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-10-14 13:31:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:43,331 INFO L225 Difference]: With dead ends: 3675 [2024-10-14 13:31:43,332 INFO L226 Difference]: Without dead ends: 1887 [2024-10-14 13:31:43,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 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-14 13:31:43,337 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:43,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:31:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2024-10-14 13:31:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1842. [2024-10-14 13:31:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1588 states have (on average 1.2248110831234258) internal successors, (1945), 1613 states have internal predecessors, (1945), 214 states have call successors, (214), 39 states have call predecessors, (214), 39 states have return successors, (214), 189 states have call predecessors, (214), 214 states have call successors, (214) [2024-10-14 13:31:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2373 transitions. [2024-10-14 13:31:43,498 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2373 transitions. Word has length 133 [2024-10-14 13:31:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:43,500 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2373 transitions. [2024-10-14 13:31:43,500 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2373 transitions. [2024-10-14 13:31:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:31:43,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:43,502 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:43,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-14 13:31:43,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:43,703 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:43,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:43,703 INFO L85 PathProgramCache]: Analyzing trace with hash 655828390, now seen corresponding path program 1 times [2024-10-14 13:31:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:43,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966163074] [2024-10-14 13:31:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:43,703 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-14 13:31:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:43,705 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:43,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 13:31:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:44,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 13:31:44,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:44,129 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 19 treesize of output 13 [2024-10-14 13:31:44,137 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 13 treesize of output 9 [2024-10-14 13:31:44,202 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 24 treesize of output 12 [2024-10-14 13:31:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 13:31:44,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:31:44,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:31:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966163074] [2024-10-14 13:31:44,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966163074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:31:44,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:31:44,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:31:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726216963] [2024-10-14 13:31:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:31:44,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:31:44,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:31:44,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:31:44,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:31:44,254 INFO L87 Difference]: Start difference. First operand 1842 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:31:44,963 INFO L93 Difference]: Finished difference Result 3128 states and 4008 transitions. [2024-10-14 13:31:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:31:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-10-14 13:31:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:31:44,979 INFO L225 Difference]: With dead ends: 3128 [2024-10-14 13:31:44,979 INFO L226 Difference]: Without dead ends: 1367 [2024-10-14 13:31:44,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:31:44,983 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 137 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:31:44,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 665 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:31:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-10-14 13:31:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1341. [2024-10-14 13:31:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1143 states have (on average 1.194225721784777) internal successors, (1365), 1160 states have internal predecessors, (1365), 164 states have call successors, (164), 33 states have call predecessors, (164), 33 states have return successors, (164), 147 states have call predecessors, (164), 164 states have call successors, (164) [2024-10-14 13:31:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1693 transitions. [2024-10-14 13:31:45,118 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1693 transitions. Word has length 134 [2024-10-14 13:31:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:31:45,119 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1693 transitions. [2024-10-14 13:31:45,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 13:31:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1693 transitions. [2024-10-14 13:31:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 13:31:45,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:31:45,121 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:31:45,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-14 13:31:45,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:31:45,321 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:31:45,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:31:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash -625544104, now seen corresponding path program 1 times [2024-10-14 13:31:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:31:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980585607] [2024-10-14 13:31:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:31:45,322 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-14 13:31:45,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:31:45,323 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:31:45,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 13:31:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:31:45,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 13:31:45,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:31:45,977 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 8 treesize of output 1 [2024-10-14 13:31:46,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:31:46,845 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 129 treesize of output 55 [2024-10-14 13:31:48,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:32:00,010 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 203 treesize of output 167 [2024-10-14 13:32:00,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:32:00,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 265 treesize of output 115 [2024-10-14 13:32:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 263 proven. 21 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-14 13:32:00,643 INFO L311 TraceCheckSpWp]: Computing backward predicates...