./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:24:17,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:24:17,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 13:24:17,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:24:17,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:24:17,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:24:17,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:24:17,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:24:17,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:24:17,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:24:17,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:24:17,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:24:17,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:24:17,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:24:17,834 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:24:17,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:24:17,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:24:17,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 13:24:17,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:24:17,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:24:17,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:24:17,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:24:17,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:24:17,841 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:24:17,841 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:24:17,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:24:17,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:24:17,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:24:17,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:24:17,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:24:17,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:24:17,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:24:17,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:24:17,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:24:17,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:24:17,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 13:24:17,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 13:24:17,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:24:17,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:24:17,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:24:17,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:24:17,847 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 [2024-11-19 13:24:18,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:24:18,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:24:18,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:24:18,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:24:18,171 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:24:18,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-19 13:24:19,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:24:19,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:24:19,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-19 13:24:19,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e884fd2/c87d7db9209f498a8d792994d341d01b/FLAG6baaa422a [2024-11-19 13:24:19,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e884fd2/c87d7db9209f498a8d792994d341d01b [2024-11-19 13:24:19,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:24:19,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:24:19,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:24:19,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:24:19,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:24:19,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:24:19" (1/1) ... [2024-11-19 13:24:19,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7deae4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:19, skipping insertion in model container [2024-11-19 13:24:19,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:24:19" (1/1) ... [2024-11-19 13:24:19,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:24:20,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:24:20,562 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:24:20,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:24:20,930 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:24:20,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20 WrapperNode [2024-11-19 13:24:20,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:24:20,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:24:20,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:24:20,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:24:20,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:20,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,048 INFO L138 Inliner]: procedures = 524, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 498 [2024-11-19 13:24:21,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:24:21,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:24:21,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:24:21,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:24:21,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,092 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 355, 2, 2, 6, 2]. 96 percent of accesses are in the largest equivalence class. The 357 initializations are split as follows [2, 355, 0, 0, 0, 0]. The 7 writes are split as follows [0, 0, 2, 1, 2, 2]. [2024-11-19 13:24:21,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:24:21,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:24:21,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:24:21,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:24:21,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (1/1) ... [2024-11-19 13:24:21,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:24:21,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:21,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 13:24:21,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 13:24:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 13:24:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 13:24:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:24:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 13:24:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 13:24:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 13:24:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 13:24:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 13:24:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-19 13:24:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:24:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:24:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 13:24:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 13:24:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 13:24:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 13:24:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 13:24:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 13:24:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 13:24:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 13:24:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 13:24:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 13:24:21,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 13:24:21,444 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:24:21,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:24:21,815 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-19 13:24:21,816 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:24:21,824 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:24:21,824 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 13:24:21,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:21 BoogieIcfgContainer [2024-11-19 13:24:21,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:24:21,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:24:21,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:24:21,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:24:21,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:24:19" (1/3) ... [2024-11-19 13:24:21,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee6dd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:24:21, skipping insertion in model container [2024-11-19 13:24:21,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:20" (2/3) ... [2024-11-19 13:24:21,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee6dd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:24:21, skipping insertion in model container [2024-11-19 13:24:21,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:21" (3/3) ... [2024-11-19 13:24:21,830 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid.i [2024-11-19 13:24:21,842 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:24:21,842 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-19 13:24:21,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:24:21,884 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;@4a8020b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:24:21,885 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-19 13:24:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 47 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 13:24:21,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:21,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 13:24:21,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:21,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-19 13:24:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355690495] [2024-11-19 13:24:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355690495] [2024-11-19 13:24:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355690495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:22,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894383076] [2024-11-19 13:24:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:22,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:22,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:22,510 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 47 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:22,545 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-11-19 13:24:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 13:24:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:22,551 INFO L225 Difference]: With dead ends: 87 [2024-11-19 13:24:22,551 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 13:24:22,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:22,555 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:22,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 13:24:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-19 13:24:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-19 13:24:22,579 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2024-11-19 13:24:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:22,579 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-19 13:24:22,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-19 13:24:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 13:24:22,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:22,580 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-19 13:24:22,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 13:24:22,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-19 13:24:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:22,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38387840] [2024-11-19 13:24:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38387840] [2024-11-19 13:24:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38387840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963326179] [2024-11-19 13:24:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:22,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:22,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:22,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:24:22,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 13:24:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:22,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:22,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:23,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963326179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:23,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:24:23,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 13:24:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388972459] [2024-11-19 13:24:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:24:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:24:23,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:23,032 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:23,052 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-19 13:24:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:24:23,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 13:24:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:23,053 INFO L225 Difference]: With dead ends: 42 [2024-11-19 13:24:23,053 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 13:24:23,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:23,054 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:23,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 13:24:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-19 13:24:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-19 13:24:23,059 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2024-11-19 13:24:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:23,059 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-19 13:24:23,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-19 13:24:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 13:24:23,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:23,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-19 13:24:23,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 13:24:23,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:23,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-19 13:24:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454819026] [2024-11-19 13:24:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 13:24:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454819026] [2024-11-19 13:24:23,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454819026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:23,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411494653] [2024-11-19 13:24:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:23,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:23,379 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:23,391 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-19 13:24:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:23,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 13:24:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:23,393 INFO L225 Difference]: With dead ends: 41 [2024-11-19 13:24:23,393 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 13:24:23,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:23,394 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:23,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 13:24:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-19 13:24:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 35 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-19 13:24:23,402 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 8 [2024-11-19 13:24:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:23,404 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-19 13:24:23,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-19 13:24:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 13:24:23,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:23,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:23,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 13:24:23,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:23,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1247305624, now seen corresponding path program 1 times [2024-11-19 13:24:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:23,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800495350] [2024-11-19 13:24:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:23,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:23,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800495350] [2024-11-19 13:24:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800495350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241237920] [2024-11-19 13:24:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:23,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:23,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:24:23,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 13:24:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:23,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:23,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 13:24:23,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241237920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:23,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:24:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-19 13:24:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533758712] [2024-11-19 13:24:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:23,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:23,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:23,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:23,763 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:23,792 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-19 13:24:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:23,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 13:24:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:23,796 INFO L225 Difference]: With dead ends: 38 [2024-11-19 13:24:23,796 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 13:24:23,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:23,797 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:23,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 13:24:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 13:24:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 33 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-19 13:24:23,806 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 13 [2024-11-19 13:24:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:23,806 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-19 13:24:23,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-19 13:24:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 13:24:23,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:23,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:23,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:24,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 13:24:24,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:24,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash 11768742, now seen corresponding path program 1 times [2024-11-19 13:24:24,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:24,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877859234] [2024-11-19 13:24:24,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:24,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:24,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877859234] [2024-11-19 13:24:24,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877859234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:24,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417249216] [2024-11-19 13:24:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:24,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:24,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:24,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:24:24,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 13:24:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:24,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:24,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:24,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417249216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:24,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:24,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 13:24:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435415676] [2024-11-19 13:24:24,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:24,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:24:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:24,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:24:24,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:24,597 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:24:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:24,624 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-11-19 13:24:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:24,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-11-19 13:24:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:24,625 INFO L225 Difference]: With dead ends: 75 [2024-11-19 13:24:24,626 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 13:24:24,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:24,627 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:24,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 13:24:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 13:24:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 42 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-19 13:24:24,630 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2024-11-19 13:24:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-19 13:24:24,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:24:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-19 13:24:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 13:24:24,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:24,631 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:24,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 13:24:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:24,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 765100852, now seen corresponding path program 2 times [2024-11-19 13:24:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074759167] [2024-11-19 13:24:24,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:24,866 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:24,866 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 13:24:25,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:25,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074759167] [2024-11-19 13:24:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074759167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:25,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:25,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 13:24:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819953802] [2024-11-19 13:24:25,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:25,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:24:25,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:25,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:24:25,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:25,004 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:25,032 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-19 13:24:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 13:24:25,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-19 13:24:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:25,033 INFO L225 Difference]: With dead ends: 45 [2024-11-19 13:24:25,033 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 13:24:25,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-19 13:24:25,034 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:25,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 84 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 13:24:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-19 13:24:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 40 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-11-19 13:24:25,038 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 23 [2024-11-19 13:24:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:25,038 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-19 13:24:25,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-19 13:24:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 13:24:25,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:25,039 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:25,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 13:24:25,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:25,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash 702570007, now seen corresponding path program 1 times [2024-11-19 13:24:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102704444] [2024-11-19 13:24:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 13:24:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:25,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102704444] [2024-11-19 13:24:25,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102704444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:25,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:25,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:25,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454387923] [2024-11-19 13:24:25,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:25,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:25,148 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:25,163 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-19 13:24:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-19 13:24:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:25,164 INFO L225 Difference]: With dead ends: 64 [2024-11-19 13:24:25,164 INFO L226 Difference]: Without dead ends: 46 [2024-11-19 13:24:25,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:25,165 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:25,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-19 13:24:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-19 13:24:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-19 13:24:25,168 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 28 [2024-11-19 13:24:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:25,168 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-19 13:24:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-19 13:24:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 13:24:25,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:25,169 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:25,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 13:24:25,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 847573913, now seen corresponding path program 1 times [2024-11-19 13:24:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894605651] [2024-11-19 13:24:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894605651] [2024-11-19 13:24:25,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894605651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024840007] [2024-11-19 13:24:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:25,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:25,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:25,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:24:25,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 13:24:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:25,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 13:24:25,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:25,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024840007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:25,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 13:24:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987535912] [2024-11-19 13:24:25,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:25,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 13:24:25,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 13:24:25,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 13:24:25,619 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:24:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:25,658 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-11-19 13:24:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 13:24:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-19 13:24:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:25,659 INFO L225 Difference]: With dead ends: 95 [2024-11-19 13:24:25,659 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 13:24:25,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 13:24:25,660 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:25,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 13:24:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 13:24:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-11-19 13:24:25,672 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 31 [2024-11-19 13:24:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:25,672 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-11-19 13:24:25,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:24:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-11-19 13:24:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 13:24:25,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:25,673 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:25,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:25,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:25,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1670984743, now seen corresponding path program 2 times [2024-11-19 13:24:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:25,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822134447] [2024-11-19 13:24:25,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:25,929 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:25,929 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:26,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:26,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822134447] [2024-11-19 13:24:26,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822134447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:26,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:26,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 13:24:26,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783299282] [2024-11-19 13:24:26,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:26,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:26,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:26,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:26,091 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:26,137 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-19 13:24:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-19 13:24:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:26,138 INFO L225 Difference]: With dead ends: 85 [2024-11-19 13:24:26,138 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 13:24:26,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:26,139 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:26,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 87 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 13:24:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-19 13:24:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.164179104477612) internal successors, (78), 71 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-19 13:24:26,147 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 49 [2024-11-19 13:24:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:26,148 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-19 13:24:26,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-19 13:24:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 13:24:26,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:26,149 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:26,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 13:24:26,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:26,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1631027293, now seen corresponding path program 1 times [2024-11-19 13:24:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:26,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926225091] [2024-11-19 13:24:26,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:26,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926225091] [2024-11-19 13:24:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926225091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049926806] [2024-11-19 13:24:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:26,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:26,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:26,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:24:26,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 13:24:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:26,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:26,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:26,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:26,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049926806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:26,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:24:26,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 13:24:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231804560] [2024-11-19 13:24:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:26,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:24:26,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:24:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:26,524 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:26,540 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-19 13:24:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:24:26,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-19 13:24:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:26,541 INFO L225 Difference]: With dead ends: 74 [2024-11-19 13:24:26,541 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 13:24:26,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:26,541 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:26,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 13:24:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-19 13:24:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-19 13:24:26,546 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 49 [2024-11-19 13:24:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:26,546 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-19 13:24:26,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-19 13:24:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 13:24:26,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:26,547 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:26,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:26,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 13:24:26,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:26,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 977761556, now seen corresponding path program 1 times [2024-11-19 13:24:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:26,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71955361] [2024-11-19 13:24:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-19 13:24:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71955361] [2024-11-19 13:24:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71955361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993553921] [2024-11-19 13:24:26,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:26,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:26,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:26,871 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:26,881 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-11-19 13:24:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:26,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-19 13:24:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:26,881 INFO L225 Difference]: With dead ends: 73 [2024-11-19 13:24:26,882 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 13:24:26,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:26,882 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:26,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 13:24:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-11-19 13:24:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 65 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-19 13:24:26,886 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 50 [2024-11-19 13:24:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:26,886 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-19 13:24:26,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-19 13:24:26,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 13:24:26,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:26,887 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:26,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 13:24:26,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:26,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:26,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1106707312, now seen corresponding path program 1 times [2024-11-19 13:24:26,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:26,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050857528] [2024-11-19 13:24:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:26,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:27,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:27,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050857528] [2024-11-19 13:24:27,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050857528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:27,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157047801] [2024-11-19 13:24:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:27,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:27,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:27,005 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:24:27,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 13:24:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:27,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:27,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:27,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157047801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:27,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:27,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 13:24:27,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986438638] [2024-11-19 13:24:27,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:27,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:24:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:24:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:27,265 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:27,287 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-11-19 13:24:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:27,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2024-11-19 13:24:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:27,288 INFO L225 Difference]: With dead ends: 106 [2024-11-19 13:24:27,288 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 13:24:27,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:27,288 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:27,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 13:24:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 13:24:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 83 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-19 13:24:27,293 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 57 [2024-11-19 13:24:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:27,294 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-19 13:24:27,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-19 13:24:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 13:24:27,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:27,294 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:27,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 13:24:27,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:27,495 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:27,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1451339836, now seen corresponding path program 2 times [2024-11-19 13:24:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:27,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185746212] [2024-11-19 13:24:27,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:27,579 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 13:24:27,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:27,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:24:27,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185746212] [2024-11-19 13:24:27,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185746212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:24:27,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348902795] [2024-11-19 13:24:27,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:27,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:27,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:27,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:24:27,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 13:24:27,962 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 13:24:27,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:27,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 13:24:27,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:27,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348902795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:28,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:24:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 13:24:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296798464] [2024-11-19 13:24:28,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:28,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 13:24:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:24:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 13:24:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 13:24:28,043 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:28,087 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2024-11-19 13:24:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 13:24:28,088 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2024-11-19 13:24:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:28,088 INFO L225 Difference]: With dead ends: 151 [2024-11-19 13:24:28,088 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 13:24:28,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 13:24:28,089 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:28,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 139 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 13:24:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-19 13:24:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0598290598290598) internal successors, (124), 119 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2024-11-19 13:24:28,095 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 66 [2024-11-19 13:24:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:28,096 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2024-11-19 13:24:28,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2024-11-19 13:24:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 13:24:28,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:28,097 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:28,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 13:24:28,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:24:28,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:28,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash 482592068, now seen corresponding path program 3 times [2024-11-19 13:24:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:24:28,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671918831] [2024-11-19 13:24:28,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 13:24:28,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:24:29,480 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 13:24:29,481 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 13:24:29,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 13:24:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:24:29,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 13:24:29,609 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 13:24:29,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 13 remaining) [2024-11-19 13:24:29,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2024-11-19 13:24:29,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2024-11-19 13:24:29,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2024-11-19 13:24:29,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2024-11-19 13:24:29,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2024-11-19 13:24:29,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2024-11-19 13:24:29,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2024-11-19 13:24:29,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2024-11-19 13:24:29,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2024-11-19 13:24:29,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2024-11-19 13:24:29,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2024-11-19 13:24:29,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2024-11-19 13:24:29,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 13:24:29,615 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:29,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 13:24:29,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:24:29 BoogieIcfgContainer [2024-11-19 13:24:29,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 13:24:29,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 13:24:29,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 13:24:29,663 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 13:24:29,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:21" (3/4) ... [2024-11-19 13:24:29,665 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 13:24:29,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 13:24:29,666 INFO L158 Benchmark]: Toolchain (without parser) took 9837.34ms. Allocated memory was 195.0MB in the beginning and 421.5MB in the end (delta: 226.5MB). Free memory was 165.5MB in the beginning and 323.1MB in the end (delta: -157.6MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,667 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:24:29,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1099.44ms. Allocated memory is still 195.0MB. Free memory was 165.5MB in the beginning and 153.0MB in the end (delta: 12.5MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.32ms. Allocated memory is still 195.0MB. Free memory was 153.0MB in the beginning and 145.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,667 INFO L158 Benchmark]: Boogie Preprocessor took 102.65ms. Allocated memory is still 195.0MB. Free memory was 145.7MB in the beginning and 139.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,667 INFO L158 Benchmark]: RCFGBuilder took 672.32ms. Allocated memory is still 195.0MB. Free memory was 139.4MB in the beginning and 93.3MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,668 INFO L158 Benchmark]: TraceAbstraction took 7836.14ms. Allocated memory was 195.0MB in the beginning and 421.5MB in the end (delta: 226.5MB). Free memory was 92.2MB in the beginning and 324.2MB in the end (delta: -232.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:24:29,668 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 421.5MB. Free memory was 324.2MB in the beginning and 323.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 13:24:29,669 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.17ms. Allocated memory is still 130.0MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1099.44ms. Allocated memory is still 195.0MB. Free memory was 165.5MB in the beginning and 153.0MB in the end (delta: 12.5MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.32ms. Allocated memory is still 195.0MB. Free memory was 153.0MB in the beginning and 145.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.65ms. Allocated memory is still 195.0MB. Free memory was 145.7MB in the beginning and 139.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 672.32ms. Allocated memory is still 195.0MB. Free memory was 139.4MB in the beginning and 93.3MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7836.14ms. Allocated memory was 195.0MB in the beginning and 421.5MB in the end (delta: 226.5MB). Free memory was 92.2MB in the beginning and 324.2MB in the end (delta: -232.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 421.5MB. Free memory was 324.2MB in the beginning and 323.1MB 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: 1774]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1774. Possible FailurePath: [L1763] static const char *applet_name; [L1764] static signed int bb_errno_location; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1858] char *a = malloc(11); [L1859] a[10] = 0 [L1860] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=1] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=2] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=3] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=4] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=5] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=6] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=7] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=8] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=9] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=10] [L1860] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1862] applet_name = a [L1863] bb_errno_location = __VERIFIER_nondet_int() [L1864] optind = 1 [L1865] int argc = __VERIFIER_nondet_int(); [L1866] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1866] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1867] EXPR argc+1 [L1867] char **argv=malloc((argc+1)*sizeof(char*)); [L1868] EXPR argc+1 [L1868] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1869] argv[argc]=0 [L1870] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0, mem_track={-13:0}, optind=1] [L1870] COND TRUE i 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 [2024-11-19 13:24:32,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:24:32,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:24:32,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:24:32,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:24:32,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:24:32,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-19 13:24:34,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:24:34,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:24:34,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-19 13:24:34,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d48e84bb/7776f68106ba48f389fd390354b7b5bf/FLAG7ca69168e [2024-11-19 13:24:34,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d48e84bb/7776f68106ba48f389fd390354b7b5bf [2024-11-19 13:24:34,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:24:34,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:24:34,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:24:34,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:24:34,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:24:34,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f960df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:34, skipping insertion in model container [2024-11-19 13:24:34,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:24:34" (1/1) ... [2024-11-19 13:24:34,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:24:35,266 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 13:24:35,268 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 13:24:35,282 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 13:24:35,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:24:35,322 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:24:35,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:24:35,571 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:24:35,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35 WrapperNode [2024-11-19 13:24:35,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:24:35,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:24:35,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:24:35,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:24:35,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,683 INFO L138 Inliner]: procedures = 531, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 491 [2024-11-19 13:24:35,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:24:35,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:24:35,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:24:35,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:24:35,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,743 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 2, 355, 6, 2, 2]. 96 percent of accesses are in the largest equivalence class. The 357 initializations are split as follows [2, 0, 355, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 2, 1, 2]. [2024-11-19 13:24:35,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:24:35,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:24:35,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:24:35,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:24:35,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (1/1) ... [2024-11-19 13:24:35,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:24:35,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:24:35,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 13:24:35,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 13:24:35,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 13:24:35,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 13:24:35,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 13:24:35,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 13:24:35,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 13:24:35,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 13:24:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 13:24:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 13:24:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 13:24:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 13:24:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 13:24:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 13:24:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 13:24:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 13:24:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 13:24:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 13:24:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 13:24:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 13:24:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 13:24:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 13:24:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:24:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 13:24:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 13:24:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 13:24:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 13:24:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 13:24:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-19 13:24:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:24:35,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:24:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 13:24:35,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 13:24:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 13:24:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 13:24:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 13:24:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 13:24:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 13:24:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-19 13:24:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 13:24:35,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 13:24:35,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 13:24:35,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 13:24:35,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 13:24:35,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 13:24:36,177 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:24:36,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:24:36,594 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-19 13:24:36,595 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:24:36,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:24:36,605 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 13:24:36,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:36 BoogieIcfgContainer [2024-11-19 13:24:36,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:24:36,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:24:36,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:24:36,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:24:36,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:24:34" (1/3) ... [2024-11-19 13:24:36,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7ea36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:24:36, skipping insertion in model container [2024-11-19 13:24:36,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:24:35" (2/3) ... [2024-11-19 13:24:36,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f7ea36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:24:36, skipping insertion in model container [2024-11-19 13:24:36,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:36" (3/3) ... [2024-11-19 13:24:36,610 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid.i [2024-11-19 13:24:36,621 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:24:36,621 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-19 13:24:36,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:24:36,672 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;@6f3b078e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:24:36,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-19 13:24:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 47 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 13:24:36,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:36,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 13:24:36,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:36,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-19 13:24:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831926321] [2024-11-19 13:24:36,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:36,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:36,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:36,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:36,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 (2)] Waiting until timeout for monitored process [2024-11-19 13:24:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:36,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 13:24:36,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:36,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:36,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831926321] [2024-11-19 13:24:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831926321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:36,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:36,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 13:24:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310808195] [2024-11-19 13:24:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:36,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 13:24:36,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 13:24:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 13:24:36,983 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 47 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:36,995 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-11-19 13:24:36,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 13:24:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 13:24:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:37,001 INFO L225 Difference]: With dead ends: 78 [2024-11-19 13:24:37,001 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 13:24:37,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 13:24:37,005 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:37,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 13:24:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 13:24:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-19 13:24:37,057 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 4 [2024-11-19 13:24:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:37,058 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-19 13:24:37,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-19 13:24:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 13:24:37,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:37,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 13:24:37,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 13:24:37,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:37,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:37,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-19 13:24:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473962980] [2024-11-19 13:24:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:37,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:37,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:37,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:37,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 13:24:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:37,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:37,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:37,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:37,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:37,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473962980] [2024-11-19 13:24:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473962980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:37,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:37,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:37,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774175718] [2024-11-19 13:24:37,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:37,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:37,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:37,685 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:37,728 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-19 13:24:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:37,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 13:24:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:37,739 INFO L225 Difference]: With dead ends: 66 [2024-11-19 13:24:37,739 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 13:24:37,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:37,741 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:37,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 13:24:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 13:24:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-19 13:24:37,752 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 5 [2024-11-19 13:24:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:37,752 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-19 13:24:37,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-19 13:24:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 13:24:37,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:37,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-19 13:24:37,767 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:37,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:37,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:37,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-19 13:24:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:37,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777259580] [2024-11-19 13:24:37,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:37,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:37,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:37,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:37,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 13:24:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:38,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:38,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:38,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:38,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:38,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777259580] [2024-11-19 13:24:38,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777259580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:38,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:38,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-19 13:24:38,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67878109] [2024-11-19 13:24:38,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:38,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:38,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:38,442 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:38,550 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-19 13:24:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:38,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 13:24:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:38,555 INFO L225 Difference]: With dead ends: 69 [2024-11-19 13:24:38,555 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 13:24:38,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:38,556 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:38,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 13:24:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-19 13:24:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-19 13:24:38,564 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2024-11-19 13:24:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:38,567 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-19 13:24:38,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:24:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-19 13:24:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 13:24:38,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:38,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:38,582 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-11-19 13:24:38,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:38,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:38,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1497124748, now seen corresponding path program 1 times [2024-11-19 13:24:38,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380934807] [2024-11-19 13:24:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:38,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:38,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:38,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:38,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 13:24:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:38,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 13:24:38,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:38,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:39,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380934807] [2024-11-19 13:24:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380934807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:39,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:39,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 13:24:39,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221032723] [2024-11-19 13:24:39,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:39,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 13:24:39,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:39,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 13:24:39,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 13:24:39,046 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:24:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:39,141 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-11-19 13:24:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 13:24:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-19 13:24:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:39,142 INFO L225 Difference]: With dead ends: 77 [2024-11-19 13:24:39,142 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 13:24:39,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-19 13:24:39,143 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:39,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:24:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 13:24:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-19 13:24:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 46 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-19 13:24:39,148 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 17 [2024-11-19 13:24:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:39,148 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-19 13:24:39,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:24:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-19 13:24:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 13:24:39,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:39,149 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:39,161 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-11-19 13:24:39,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:39,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:39,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1161315828, now seen corresponding path program 2 times [2024-11-19 13:24:39,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984414055] [2024-11-19 13:24:39,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:39,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:39,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 13:24:39,517 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:39,517 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:39,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 13:24:39,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-19 13:24:39,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:39,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:39,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984414055] [2024-11-19 13:24:39,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984414055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:39,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:39,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 13:24:39,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110563800] [2024-11-19 13:24:39,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:39,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:24:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:39,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:24:39,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:24:39,570 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:39,856 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-19 13:24:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 13:24:39,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-19 13:24:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:39,857 INFO L225 Difference]: With dead ends: 49 [2024-11-19 13:24:39,857 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 13:24:39,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-11-19 13:24:39,858 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:39,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 78 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 13:24:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 13:24:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-19 13:24:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-19 13:24:39,863 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 29 [2024-11-19 13:24:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:39,863 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-19 13:24:39,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-19 13:24:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 13:24:39,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:39,864 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:39,873 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-11-19 13:24:40,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:40,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:40,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1704728544, now seen corresponding path program 1 times [2024-11-19 13:24:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:40,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815658445] [2024-11-19 13:24:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:40,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:40,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:40,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:40,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 13:24:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:40,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 13:24:40,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:40,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:24:40,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815658445] [2024-11-19 13:24:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815658445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:40,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 13:24:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941850934] [2024-11-19 13:24:40,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 13:24:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 13:24:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-19 13:24:40,529 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:24:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:40,768 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-11-19 13:24:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 13:24:40,768 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-19 13:24:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:40,769 INFO L225 Difference]: With dead ends: 85 [2024-11-19 13:24:40,769 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 13:24:40,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-19 13:24:40,770 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:40,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 227 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 13:24:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 13:24:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2024-11-19 13:24:40,775 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 35 [2024-11-19 13:24:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:40,775 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-11-19 13:24:40,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:24:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2024-11-19 13:24:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 13:24:40,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:40,776 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:40,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 13:24:40,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:40,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:40,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash -819573408, now seen corresponding path program 2 times [2024-11-19 13:24:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:40,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027256676] [2024-11-19 13:24:40,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:40,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:40,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:40,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:40,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 13:24:41,274 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 13:24:41,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:41,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 13:24:41,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:41,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:41,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027256676] [2024-11-19 13:24:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027256676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:41,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:41,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:24:41,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364930159] [2024-11-19 13:24:41,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:41,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:24:41,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:41,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:24:41,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:41,295 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:41,327 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-19 13:24:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:24:41,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-11-19 13:24:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:41,329 INFO L225 Difference]: With dead ends: 78 [2024-11-19 13:24:41,329 INFO L226 Difference]: Without dead ends: 62 [2024-11-19 13:24:41,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:24:41,330 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:41,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:24:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-19 13:24:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-19 13:24:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.105263157894737) internal successors, (63), 59 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-11-19 13:24:41,337 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 47 [2024-11-19 13:24:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:41,337 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-11-19 13:24:41,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-11-19 13:24:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 13:24:41,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:41,338 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:41,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 13:24:41,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:41,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:41,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1670984743, now seen corresponding path program 1 times [2024-11-19 13:24:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850168300] [2024-11-19 13:24:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:41,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:41,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:41,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:41,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 13:24:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:41,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 13:24:41,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:41,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:24:41,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850168300] [2024-11-19 13:24:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850168300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:24:41,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:24:41,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 13:24:41,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931836876] [2024-11-19 13:24:41,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:24:41,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:41,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:41,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:41,854 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:42,126 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-19 13:24:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-19 13:24:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:42,128 INFO L225 Difference]: With dead ends: 81 [2024-11-19 13:24:42,128 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 13:24:42,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:42,129 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:42,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 88 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 13:24:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 13:24:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-19 13:24:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 69 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-19 13:24:42,134 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 49 [2024-11-19 13:24:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:42,134 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-19 13:24:42,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-19 13:24:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 13:24:42,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:42,136 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:42,147 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-11-19 13:24:42,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:42,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:42,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash 977761556, now seen corresponding path program 1 times [2024-11-19 13:24:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010638750] [2024-11-19 13:24:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:42,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:42,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:42,342 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:42,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 13:24:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:42,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 13:24:42,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:42,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:42,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010638750] [2024-11-19 13:24:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010638750] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:42,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-19 13:24:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918935953] [2024-11-19 13:24:42,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:24:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:24:42,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:24:42,747 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:42,936 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-11-19 13:24:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:24:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-19 13:24:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:42,942 INFO L225 Difference]: With dead ends: 101 [2024-11-19 13:24:42,942 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 13:24:42,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:24:42,942 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:42,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 13:24:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-11-19 13:24:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 70 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-19 13:24:42,966 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 50 [2024-11-19 13:24:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:42,967 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-19 13:24:42,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-19 13:24:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 13:24:42,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:42,973 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:42,985 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-11-19 13:24:43,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:43,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:43,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -67955900, now seen corresponding path program 1 times [2024-11-19 13:24:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:43,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532932184] [2024-11-19 13:24:43,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:24:43,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:43,179 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 13:24:43,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 13:24:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:24:43,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 13:24:43,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:43,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:43,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:43,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532932184] [2024-11-19 13:24:43,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532932184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:43,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:43,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 13:24:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361042458] [2024-11-19 13:24:43,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:43,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 13:24:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 13:24:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 13:24:43,694 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:43,933 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2024-11-19 13:24:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 13:24:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2024-11-19 13:24:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:43,936 INFO L225 Difference]: With dead ends: 119 [2024-11-19 13:24:43,940 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 13:24:43,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-19 13:24:43,941 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:43,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 108 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 13:24:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 13:24:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 13:24:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.064516129032258) internal successors, (99), 94 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-19 13:24:43,962 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 60 [2024-11-19 13:24:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:43,963 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-19 13:24:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-19 13:24:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 13:24:43,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:43,964 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:43,986 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 (11)] Forceful destruction successful, exit code 0 [2024-11-19 13:24:44,164 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-11-19 13:24:44,164 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:44,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash 734669892, now seen corresponding path program 2 times [2024-11-19 13:24:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693938707] [2024-11-19 13:24:44,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 13:24:44,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:44,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:44,167 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-11-19 13:24:44,175 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-11-19 13:24:47,226 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 13:24:47,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 13:24:47,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 13:24:47,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:24:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:47,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:24:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 13:24:47,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 13:24:47,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693938707] [2024-11-19 13:24:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693938707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:24:47,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 13:24:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 13:24:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795421171] [2024-11-19 13:24:47,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 13:24:47,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 13:24:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 13:24:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 13:24:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-19 13:24:47,615 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:24:48,258 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-19 13:24:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 13:24:48,259 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-19 13:24:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:24:48,264 INFO L225 Difference]: With dead ends: 155 [2024-11-19 13:24:48,264 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 13:24:48,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-19 13:24:48,264 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 13:24:48,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 212 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 13:24:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 13:24:48,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-19 13:24:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 117 states have (on average 1.0512820512820513) internal successors, (123), 118 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2024-11-19 13:24:48,288 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 72 [2024-11-19 13:24:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:24:48,288 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2024-11-19 13:24:48,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 13:24:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2024-11-19 13:24:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 13:24:48,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:24:48,289 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:24:48,303 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 (12)] Ended with exit code 0 [2024-11-19 13:24:48,489 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-11-19 13:24:48,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-11-19 13:24:48,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:24:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash 482592068, now seen corresponding path program 3 times [2024-11-19 13:24:48,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 13:24:48,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503631578] [2024-11-19 13:24:48,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 13:24:48,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 13:24:48,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 13:24:48,493 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-11-19 13:24:48,494 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-11-19 13:25:03,042 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 13:25:03,042 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 13:25:03,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 13:25:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 13:25:08,024 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 13:25:08,024 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 13:25:08,025 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 13 remaining) [2024-11-19 13:25:08,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2024-11-19 13:25:08,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2024-11-19 13:25:08,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2024-11-19 13:25:08,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2024-11-19 13:25:08,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2024-11-19 13:25:08,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2024-11-19 13:25:08,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2024-11-19 13:25:08,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2024-11-19 13:25:08,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2024-11-19 13:25:08,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2024-11-19 13:25:08,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2024-11-19 13:25:08,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2024-11-19 13:25:08,056 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 (13)] Ended with exit code 0 [2024-11-19 13:25:08,233 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-11-19 13:25:08,236 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 13:25:08,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 13:25:08,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:25:08 BoogieIcfgContainer [2024-11-19 13:25:08,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 13:25:08,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 13:25:08,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 13:25:08,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 13:25:08,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:24:36" (3/4) ... [2024-11-19 13:25:08,325 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 13:25:08,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 13:25:08,327 INFO L158 Benchmark]: Toolchain (without parser) took 33711.90ms. Allocated memory was 71.3MB in the beginning and 161.5MB in the end (delta: 90.2MB). Free memory was 47.9MB in the beginning and 74.4MB in the end (delta: -26.6MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2024-11-19 13:25:08,327 INFO L158 Benchmark]: CDTParser took 3.74ms. Allocated memory is still 52.4MB. Free memory is still 29.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:25:08,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 954.33ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 47.9MB in the beginning and 70.9MB in the end (delta: -23.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 13:25:08,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.82ms. Allocated memory is still 104.9MB. Free memory was 70.9MB in the beginning and 64.0MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 13:25:08,328 INFO L158 Benchmark]: Boogie Preprocessor took 146.99ms. Allocated memory is still 104.9MB. Free memory was 64.0MB in the beginning and 55.3MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 13:25:08,328 INFO L158 Benchmark]: RCFGBuilder took 773.68ms. Allocated memory is still 104.9MB. Free memory was 54.7MB in the beginning and 47.6MB in the end (delta: 7.1MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-11-19 13:25:08,328 INFO L158 Benchmark]: TraceAbstraction took 31716.31ms. Allocated memory was 104.9MB in the beginning and 161.5MB in the end (delta: 56.6MB). Free memory was 46.8MB in the beginning and 74.4MB in the end (delta: -27.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-19 13:25:08,329 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 161.5MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 13:25:08,330 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.74ms. Allocated memory is still 52.4MB. Free memory is still 29.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 954.33ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 47.9MB in the beginning and 70.9MB in the end (delta: -23.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.82ms. Allocated memory is still 104.9MB. Free memory was 70.9MB in the beginning and 64.0MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.99ms. Allocated memory is still 104.9MB. Free memory was 64.0MB in the beginning and 55.3MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 773.68ms. Allocated memory is still 104.9MB. Free memory was 54.7MB in the beginning and 47.6MB in the end (delta: 7.1MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 31716.31ms. Allocated memory was 104.9MB in the beginning and 161.5MB in the end (delta: 56.6MB). Free memory was 46.8MB in the beginning and 74.4MB in the end (delta: -27.6MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 161.5MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1774]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1774. Possible FailurePath: [L1763] static const char *applet_name; [L1764] static signed int bb_errno_location; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1858] char *a = malloc(11); [L1859] a[10] = 0 [L1860] int i=0; VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=1] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=2] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=3] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=4] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=5] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=6] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=7] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=8] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=9] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=10] [L1860] COND FALSE !(i<10) VAL [a={7:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1862] applet_name = a [L1863] bb_errno_location = __VERIFIER_nondet_int() [L1864] optind = 1 [L1865] int argc = __VERIFIER_nondet_int(); [L1866] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={7:0}, dummy_utmp={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={7:0}, dummy_utmp={3:0}, optind=1] [L1866] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={7:0}, argc=1, dummy_utmp={3:0}, optind=1] [L1867] EXPR argc+1 [L1867] char **argv=malloc((argc+1)*sizeof(char*)); [L1868] EXPR argc+1 [L1868] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1869] argv[argc]=0 [L1870] int i=0; VAL [applet_name={7:0}, argc=1, argv={11:0}, dummy_utmp={3:0}, i=0, mem_track={6:0}, optind=1] [L1870] COND TRUE i