./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-wip.dd.update-z3-fca748b-m [2024-11-20 21:20:52,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 21:20:52,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 21:20:52,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 21:20:52,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 21:20:52,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 21:20:52,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 21:20:52,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 21:20:52,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 21:20:52,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 21:20:52,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 21:20:52,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 21:20:52,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 21:20:52,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 21:20:52,876 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 21:20:52,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 21:20:52,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 21:20:52,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 21:20:52,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 21:20:52,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 21:20:52,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 21:20:52,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 21:20:52,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 21:20:52,882 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 21:20:52,882 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 21:20:52,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 21:20:52,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 21:20:52,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 21:20:52,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 21:20:52,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 21:20:52,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 21:20:52,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:20:52,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 21:20:52,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 21:20:52,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 21:20:52,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 21:20:52,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 21:20:52,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 21:20:52,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 21:20:52,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 21:20:52,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 21:20:52,888 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-20 21:20:53,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 21:20:53,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 21:20:53,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 21:20:53,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 21:20:53,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 21:20:53,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-20 21:20:54,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 21:20:54,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 21:20:54,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-20 21:20:55,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20e090fc/f81e2dd4b281473dbff61dd5bbdd06a0/FLAG61e751590 [2024-11-20 21:20:55,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20e090fc/f81e2dd4b281473dbff61dd5bbdd06a0 [2024-11-20 21:20:55,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 21:20:55,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 21:20:55,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 21:20:55,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 21:20:55,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 21:20:55,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:20:55" (1/1) ... [2024-11-20 21:20:55,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e994fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:55, skipping insertion in model container [2024-11-20 21:20:55,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:20:55" (1/1) ... [2024-11-20 21:20:55,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 21:20:55,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:20:55,948 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 21:20:56,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:20:56,186 INFO L204 MainTranslator]: Completed translation [2024-11-20 21:20:56,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56 WrapperNode [2024-11-20 21:20:56,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 21:20:56,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 21:20:56,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 21:20:56,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 21:20:56,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,281 INFO L138 Inliner]: procedures = 524, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 498 [2024-11-20 21:20:56,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 21:20:56,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 21:20:56,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 21:20:56,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 21:20:56,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,326 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 6, 355, 2, 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, 1, 2, 2]. [2024-11-20 21:20:56,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 21:20:56,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 21:20:56,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 21:20:56,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 21:20:56,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (1/1) ... [2024-11-20 21:20:56,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:20:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:56,441 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-20 21:20:56,445 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-20 21:20:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 21:20:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 21:20:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 21:20:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 21:20:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 21:20:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 21:20:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-20 21:20:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-20 21:20:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-20 21:20:56,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 21:20:56,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 21:20:56,482 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 21:20:56,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 21:20:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 21:20:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 21:20:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 21:20:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-20 21:20:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-20 21:20:56,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-20 21:20:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 21:20:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 21:20:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 21:20:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 21:20:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 21:20:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 21:20:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 21:20:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 21:20:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 21:20:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 21:20:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 21:20:56,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 21:20:56,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 21:20:56,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 21:20:57,159 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-20 21:20:57,159 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 21:20:57,170 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 21:20:57,172 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-20 21:20:57,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:57 BoogieIcfgContainer [2024-11-20 21:20:57,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 21:20:57,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 21:20:57,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 21:20:57,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 21:20:57,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:20:55" (1/3) ... [2024-11-20 21:20:57,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81c302f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:20:57, skipping insertion in model container [2024-11-20 21:20:57,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:56" (2/3) ... [2024-11-20 21:20:57,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81c302f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:20:57, skipping insertion in model container [2024-11-20 21:20:57,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:57" (3/3) ... [2024-11-20 21:20:57,181 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid.i [2024-11-20 21:20:57,196 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 21:20:57,197 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-20 21:20:57,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 21:20:57,243 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;@7d731e5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 21:20:57,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-20 21:20:57,249 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-20 21:20:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 21:20:57,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:57,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 21:20:57,263 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-20 21:20:57,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-20 21:20:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:57,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735271114] [2024-11-20 21:20:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:57,759 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-20 21:20:57,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735271114] [2024-11-20 21:20:57,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735271114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:57,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:57,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529818334] [2024-11-20 21:20:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:57,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:57,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:57,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:57,785 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-20 21:20:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:57,816 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-11-20 21:20:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:57,818 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-20 21:20:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:57,822 INFO L225 Difference]: With dead ends: 87 [2024-11-20 21:20:57,822 INFO L226 Difference]: Without dead ends: 42 [2024-11-20 21:20:57,824 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-20 21:20:57,827 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-20 21:20:57,827 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-20 21:20:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-20 21:20:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-20 21:20:57,851 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-20 21:20:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-20 21:20:57,853 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2024-11-20 21:20:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:57,853 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-20 21:20:57,853 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-20 21:20:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-20 21:20:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 21:20:57,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:57,854 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-20 21:20:57,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 21:20:57,854 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-20 21:20:57,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-20 21:20:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702833668] [2024-11-20 21:20:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,043 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-20 21:20:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702833668] [2024-11-20 21:20:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702833668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:58,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297891204] [2024-11-20 21:20:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:58,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:58,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:58,049 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-20 21:20:58,053 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-20 21:20:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:58,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:58,305 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-20 21:20:58,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297891204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:58,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:58,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-20 21:20:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800958320] [2024-11-20 21:20:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:58,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:58,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:58,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:58,310 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-20 21:20:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:58,331 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-20 21:20:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:58,331 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-20 21:20:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:58,332 INFO L225 Difference]: With dead ends: 42 [2024-11-20 21:20:58,332 INFO L226 Difference]: Without dead ends: 41 [2024-11-20 21:20:58,332 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-20 21:20:58,333 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-20 21:20:58,333 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-20 21:20:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-20 21:20:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-20 21:20:58,336 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-20 21:20:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-20 21:20:58,337 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 7 [2024-11-20 21:20:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:58,337 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-20 21:20:58,338 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-20 21:20:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-20 21:20:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 21:20:58,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:58,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-20 21:20:58,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:58,539 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-20 21:20:58,539 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-20 21:20:58,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-20 21:20:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562971579] [2024-11-20 21:20:58,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,667 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-20 21:20:58,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562971579] [2024-11-20 21:20:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562971579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:58,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162462054] [2024-11-20 21:20:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:58,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:58,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:58,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:58,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:58,669 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-20 21:20:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:58,685 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-20 21:20:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:58,685 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-20 21:20:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:58,686 INFO L225 Difference]: With dead ends: 41 [2024-11-20 21:20:58,686 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 21:20:58,686 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-20 21:20:58,687 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-20 21:20:58,687 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-20 21:20:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 21:20:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-20 21:20:58,693 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-20 21:20:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-20 21:20:58,694 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 8 [2024-11-20 21:20:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-20 21:20:58,694 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-20 21:20:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-20 21:20:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 21:20:58,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:58,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:58,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 21:20:58,695 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-20 21:20:58,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1247305624, now seen corresponding path program 1 times [2024-11-20 21:20:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660622855] [2024-11-20 21:20:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-20 21:20:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,874 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-20 21:20:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660622855] [2024-11-20 21:20:58,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660622855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897727195] [2024-11-20 21:20:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:58,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:58,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:58,881 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-20 21:20:58,885 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-20 21:20:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:59,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:20:59,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:59,093 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-20 21:20:59,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897727195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:59,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:59,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-20 21:20:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32872964] [2024-11-20 21:20:59,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:59,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:59,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:59,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:59,098 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-20 21:20:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:59,127 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-20 21:20:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:59,128 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-20 21:20:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:59,128 INFO L225 Difference]: With dead ends: 38 [2024-11-20 21:20:59,129 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 21:20:59,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-20 21:20:59,130 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-20 21:20:59,131 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-20 21:20:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 21:20:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 21:20:59,135 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-20 21:20:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-20 21:20:59,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 13 [2024-11-20 21:20:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:59,137 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-20 21:20:59,137 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-20 21:20:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-20 21:20:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 21:20:59,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:59,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:59,146 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-20 21:20:59,338 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-20 21:20:59,339 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-20 21:20:59,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:59,339 INFO L85 PathProgramCache]: Analyzing trace with hash 11768742, now seen corresponding path program 1 times [2024-11-20 21:20:59,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:59,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197141040] [2024-11-20 21:20:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-20 21:20:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:59,438 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-20 21:20:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197141040] [2024-11-20 21:20:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197141040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598320238] [2024-11-20 21:20:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:59,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:59,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:59,441 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-20 21:20:59,442 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-20 21:20:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:59,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:59,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:59,603 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-20 21:20:59,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:59,624 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-20 21:20:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598320238] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:59,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 21:20:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961074849] [2024-11-20 21:20:59,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:59,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:59,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:59,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:59,626 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-20 21:20:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:59,647 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-11-20 21:20:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:59,648 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-20 21:20:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:59,648 INFO L225 Difference]: With dead ends: 75 [2024-11-20 21:20:59,648 INFO L226 Difference]: Without dead ends: 45 [2024-11-20 21:20:59,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-20 21:20:59,649 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:59,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 131 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-20 21:20:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-20 21:20:59,652 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-20 21:20:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-20 21:20:59,653 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2024-11-20 21:20:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:59,653 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-20 21:20:59,653 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-20 21:20:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-20 21:20:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 21:20:59,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:59,654 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:59,662 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-20 21:20:59,854 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-20 21:20:59,855 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-20 21:20:59,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash 765100852, now seen corresponding path program 2 times [2024-11-20 21:20:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055918867] [2024-11-20 21:20:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:21:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:00,142 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-20 21:21:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:00,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055918867] [2024-11-20 21:21:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055918867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:00,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101573189] [2024-11-20 21:21:00,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:00,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:00,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:00,147 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-20 21:21:00,150 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-20 21:21:00,309 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:00,309 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:00,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:21:00,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:00,353 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-20 21:21:00,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:00,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101573189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:00,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:21:00,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 21:21:00,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188193065] [2024-11-20 21:21:00,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:00,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:21:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:00,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:21:00,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:21:00,355 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-20 21:21:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:00,389 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-20 21:21:00,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:21:00,389 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-20 21:21:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:00,390 INFO L225 Difference]: With dead ends: 45 [2024-11-20 21:21:00,390 INFO L226 Difference]: Without dead ends: 43 [2024-11-20 21:21:00,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:21:00,391 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-20 21:21:00,391 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-20 21:21:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-20 21:21:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-20 21:21:00,394 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-20 21:21:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-11-20 21:21:00,394 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 23 [2024-11-20 21:21:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:00,395 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-20 21:21:00,395 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-20 21:21:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-20 21:21:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 21:21:00,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:00,396 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-20 21:21:00,405 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-20 21:21:00,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:00,597 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-20 21:21:00,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:00,597 INFO L85 PathProgramCache]: Analyzing trace with hash 702570007, now seen corresponding path program 1 times [2024-11-20 21:21:00,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872519877] [2024-11-20 21:21:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:00,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:00,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:21:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:00,718 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-20 21:21:00,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:00,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872519877] [2024-11-20 21:21:00,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872519877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:00,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:00,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:00,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111840069] [2024-11-20 21:21:00,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:00,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:00,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:00,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:00,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:00,720 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-20 21:21:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:00,742 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-20 21:21:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:00,742 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-20 21:21:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:00,743 INFO L225 Difference]: With dead ends: 64 [2024-11-20 21:21:00,743 INFO L226 Difference]: Without dead ends: 46 [2024-11-20 21:21:00,743 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-20 21:21:00,744 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-20 21:21:00,744 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-20 21:21:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-20 21:21:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-20 21:21:00,747 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-20 21:21:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-20 21:21:00,747 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 28 [2024-11-20 21:21:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:00,748 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-20 21:21:00,748 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-20 21:21:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-20 21:21:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 21:21:00,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:00,748 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-20 21:21:00,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 21:21:00,749 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-20 21:21:00,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash 847573913, now seen corresponding path program 1 times [2024-11-20 21:21:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330180818] [2024-11-20 21:21:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:21:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:00,953 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-20 21:21:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330180818] [2024-11-20 21:21:00,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330180818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:00,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463523961] [2024-11-20 21:21:00,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:00,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:00,957 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-20 21:21:00,958 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-20 21:21:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:01,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:21:01,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:01,206 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-20 21:21:01,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:01,271 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-20 21:21:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463523961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:01,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:21:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-20 21:21:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051065704] [2024-11-20 21:21:01,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:01,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 21:21:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:01,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 21:21:01,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:21:01,273 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-20 21:21:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:01,319 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-11-20 21:21:01,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:01,320 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-20 21:21:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:01,320 INFO L225 Difference]: With dead ends: 95 [2024-11-20 21:21:01,320 INFO L226 Difference]: Without dead ends: 64 [2024-11-20 21:21:01,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 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-20 21:21:01,321 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-20 21:21:01,322 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-20 21:21:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-20 21:21:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-20 21:21:01,326 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-20 21:21:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-11-20 21:21:01,327 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 31 [2024-11-20 21:21:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:01,327 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-11-20 21:21:01,327 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-20 21:21:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-11-20 21:21:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-20 21:21:01,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:01,328 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-20 21:21:01,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 21:21:01,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:01,533 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-20 21:21:01,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1670984743, now seen corresponding path program 2 times [2024-11-20 21:21:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585312519] [2024-11-20 21:21:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:21:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:01,843 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-20 21:21:01,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:01,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585312519] [2024-11-20 21:21:01,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585312519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:01,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:01,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 21:21:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965378930] [2024-11-20 21:21:01,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:01,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:01,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:01,845 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-20 21:21:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:01,896 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-20 21:21:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:01,896 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-20 21:21:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:01,897 INFO L225 Difference]: With dead ends: 85 [2024-11-20 21:21:01,897 INFO L226 Difference]: Without dead ends: 76 [2024-11-20 21:21:01,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:01,898 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:01,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:21:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-20 21:21:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-20 21:21:01,902 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-20 21:21:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-20 21:21:01,903 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 49 [2024-11-20 21:21:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:01,903 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-20 21:21:01,903 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-20 21:21:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-20 21:21:01,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-20 21:21:01,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:01,904 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-20 21:21:01,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 21:21:01,904 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-20 21:21:01,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1631027293, now seen corresponding path program 1 times [2024-11-20 21:21:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973308820] [2024-11-20 21:21:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:01,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:21:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,058 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-20 21:21:02,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973308820] [2024-11-20 21:21:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973308820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641826293] [2024-11-20 21:21:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:02,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:02,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:02,062 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-20 21:21:02,067 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-20 21:21:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:02,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:02,303 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-20 21:21:02,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:02,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641826293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:02,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:21:02,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-20 21:21:02,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893351755] [2024-11-20 21:21:02,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:02,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:21:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:02,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:21:02,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:21:02,305 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-20 21:21:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:02,322 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-11-20 21:21:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:21:02,323 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-20 21:21:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:02,323 INFO L225 Difference]: With dead ends: 74 [2024-11-20 21:21:02,324 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 21:21:02,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-20 21:21:02,324 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-20 21:21:02,325 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-20 21:21:02,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 21:21:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-20 21:21:02,328 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-20 21:21:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-20 21:21:02,329 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 49 [2024-11-20 21:21:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:02,329 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-20 21:21:02,329 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-20 21:21:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-20 21:21:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:21:02,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:02,330 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-20 21:21:02,342 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-20 21:21:02,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:02,531 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-20 21:21:02,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:02,532 INFO L85 PathProgramCache]: Analyzing trace with hash 977761556, now seen corresponding path program 1 times [2024-11-20 21:21:02,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:02,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595057035] [2024-11-20 21:21:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:02,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:21:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,725 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-20 21:21:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:02,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595057035] [2024-11-20 21:21:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595057035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18859632] [2024-11-20 21:21:02,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:02,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:02,730 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-20 21:21:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:02,745 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-11-20 21:21:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:02,746 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-20 21:21:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:02,747 INFO L225 Difference]: With dead ends: 73 [2024-11-20 21:21:02,747 INFO L226 Difference]: Without dead ends: 72 [2024-11-20 21:21:02,747 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-20 21:21:02,748 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-20 21:21:02,749 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-20 21:21:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-20 21:21:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-11-20 21:21:02,756 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-20 21:21:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-20 21:21:02,757 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 50 [2024-11-20 21:21:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:02,760 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-20 21:21:02,760 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-20 21:21:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-20 21:21:02,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 21:21:02,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:02,761 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-20 21:21:02,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 21:21:02,762 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-20 21:21:02,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:02,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1106707312, now seen corresponding path program 1 times [2024-11-20 21:21:02,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:02,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419643202] [2024-11-20 21:21:02,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:21:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,936 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-20 21:21:02,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:02,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419643202] [2024-11-20 21:21:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419643202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:02,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381490526] [2024-11-20 21:21:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:02,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:02,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:02,939 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-20 21:21:02,940 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-20 21:21:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:03,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:03,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:03,173 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-20 21:21:03,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:03,189 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-20 21:21:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381490526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:03,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:21:03,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 21:21:03,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122815342] [2024-11-20 21:21:03,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:21:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:21:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:21:03,191 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-20 21:21:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:03,211 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-11-20 21:21:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:03,212 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-20 21:21:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:03,213 INFO L225 Difference]: With dead ends: 106 [2024-11-20 21:21:03,213 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 21:21:03,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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-20 21:21:03,213 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:03,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:21:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 21:21:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 21:21:03,217 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-20 21:21:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-20 21:21:03,218 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 57 [2024-11-20 21:21:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:03,219 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-20 21:21:03,219 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-20 21:21:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-20 21:21:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 21:21:03,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:03,220 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-20 21:21:03,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:03,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:03,421 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-20 21:21:03,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1451339836, now seen corresponding path program 2 times [2024-11-20 21:21:03,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:03,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238103775] [2024-11-20 21:21:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:21:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:03,610 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-20 21:21:03,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:03,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238103775] [2024-11-20 21:21:03,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238103775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:03,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303276887] [2024-11-20 21:21:03,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:03,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:03,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:03,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 21:21:03,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 21:21:03,891 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 21:21:03,892 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:03,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:21:03,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:03,926 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-20 21:21:03,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:04,000 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-20 21:21:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303276887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:04,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:21:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-20 21:21:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526173785] [2024-11-20 21:21:04,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:04,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 21:21:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 21:21:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:21:04,009 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-20 21:21:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:04,064 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2024-11-20 21:21:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:04,064 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-20 21:21:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:04,065 INFO L225 Difference]: With dead ends: 151 [2024-11-20 21:21:04,065 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 21:21:04,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 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-20 21:21:04,066 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 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.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:04,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:21:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 21:21:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-20 21:21:04,071 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-20 21:21:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2024-11-20 21:21:04,071 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 66 [2024-11-20 21:21:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:04,072 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2024-11-20 21:21:04,072 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-20 21:21:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2024-11-20 21:21:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 21:21:04,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:04,073 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-20 21:21:04,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 21:21:04,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-20 21:21:04,274 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-20 21:21:04,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:04,274 INFO L85 PathProgramCache]: Analyzing trace with hash 482592068, now seen corresponding path program 3 times [2024-11-20 21:21:04,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:04,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074698738] [2024-11-20 21:21:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:04,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 21:21:04,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 21:21:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 21:21:04,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 21:21:04,559 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 21:21:04,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 13 remaining) [2024-11-20 21:21:04,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2024-11-20 21:21:04,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2024-11-20 21:21:04,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2024-11-20 21:21:04,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2024-11-20 21:21:04,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2024-11-20 21:21:04,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2024-11-20 21:21:04,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2024-11-20 21:21:04,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2024-11-20 21:21:04,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2024-11-20 21:21:04,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2024-11-20 21:21:04,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2024-11-20 21:21:04,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2024-11-20 21:21:04,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 21:21:04,565 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:04,637 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 21:21:04,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:21:04 BoogieIcfgContainer [2024-11-20 21:21:04,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 21:21:04,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 21:21:04,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 21:21:04,641 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 21:21:04,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:57" (3/4) ... [2024-11-20 21:21:04,643 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 21:21:04,644 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 21:21:04,644 INFO L158 Benchmark]: Toolchain (without parser) took 9384.34ms. Allocated memory was 176.2MB in the beginning and 411.0MB in the end (delta: 234.9MB). Free memory was 120.8MB in the beginning and 236.2MB in the end (delta: -115.4MB). Peak memory consumption was 120.7MB. Max. memory is 16.1GB. [2024-11-20 21:21:04,644 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 21:21:04,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 928.57ms. Allocated memory was 176.2MB in the beginning and 299.9MB in the end (delta: 123.7MB). Free memory was 120.3MB in the beginning and 241.9MB in the end (delta: -121.6MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2024-11-20 21:21:04,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.52ms. Allocated memory is still 299.9MB. Free memory was 241.9MB in the beginning and 235.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 21:21:04,645 INFO L158 Benchmark]: Boogie Preprocessor took 106.95ms. Allocated memory is still 299.9MB. Free memory was 235.6MB in the beginning and 229.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 21:21:04,645 INFO L158 Benchmark]: RCFGBuilder took 782.97ms. Allocated memory is still 299.9MB. Free memory was 229.3MB in the beginning and 180.1MB in the end (delta: 49.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-20 21:21:04,645 INFO L158 Benchmark]: TraceAbstraction took 7464.80ms. Allocated memory was 299.9MB in the beginning and 411.0MB in the end (delta: 111.1MB). Free memory was 179.0MB in the beginning and 237.3MB in the end (delta: -58.3MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2024-11-20 21:21:04,645 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 411.0MB. Free memory was 237.3MB in the beginning and 236.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 21:21:04,646 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.13ms. Allocated memory is still 176.2MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 928.57ms. Allocated memory was 176.2MB in the beginning and 299.9MB in the end (delta: 123.7MB). Free memory was 120.3MB in the beginning and 241.9MB in the end (delta: -121.6MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.52ms. Allocated memory is still 299.9MB. Free memory was 241.9MB in the beginning and 235.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.95ms. Allocated memory is still 299.9MB. Free memory was 235.6MB in the beginning and 229.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 782.97ms. Allocated memory is still 299.9MB. Free memory was 229.3MB in the beginning and 180.1MB in the end (delta: 49.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7464.80ms. Allocated memory was 299.9MB in the beginning and 411.0MB in the end (delta: 111.1MB). Free memory was 179.0MB in the beginning and 237.3MB in the end (delta: -58.3MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 411.0MB. Free memory was 237.3MB in the beginning and 236.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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-20 21:21:07,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 21:21:07,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 21:21:07,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 21:21:07,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 21:21:07,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 21:21:07,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-20 21:21:08,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 21:21:08,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 21:21:08,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2024-11-20 21:21:08,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c191305/76c113b3676a4fd6ac3ace14dc5c0f83/FLAG25a07eaa3 [2024-11-20 21:21:09,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c191305/76c113b3676a4fd6ac3ace14dc5c0f83 [2024-11-20 21:21:09,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 21:21:09,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 21:21:09,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 21:21:09,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 21:21:09,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 21:21:09,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:21:09" (1/1) ... [2024-11-20 21:21:09,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b0601d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:09, skipping insertion in model container [2024-11-20 21:21:09,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:21:09" (1/1) ... [2024-11-20 21:21:09,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 21:21:09,919 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-20 21:21:09,921 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-20 21:21:09,942 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-20 21:21:09,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:21:09,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 21:21:10,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:21:10,250 INFO L204 MainTranslator]: Completed translation [2024-11-20 21:21:10,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10 WrapperNode [2024-11-20 21:21:10,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 21:21:10,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 21:21:10,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 21:21:10,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 21:21:10,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,325 INFO L138 Inliner]: procedures = 531, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 491 [2024-11-20 21:21:10,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 21:21:10,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 21:21:10,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 21:21:10,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 21:21:10,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,387 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 2, 355, 2, 6, 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, 1, 2, 2]. [2024-11-20 21:21:10,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 21:21:10,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 21:21:10,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 21:21:10,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 21:21:10,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (1/1) ... [2024-11-20 21:21:10,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:21:10,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:10,460 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-20 21:21:10,467 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-20 21:21:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 21:21:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 21:21:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 21:21:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 21:21:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 21:21:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 21:21:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-20 21:21:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 21:21:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 21:21:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 21:21:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 21:21:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 21:21:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 21:21:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 21:21:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 21:21:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 21:21:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 21:21:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 21:21:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-20 21:21:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 21:21:10,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 21:21:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 21:21:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 21:21:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 21:21:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-20 21:21:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-20 21:21:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-20 21:21:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 21:21:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 21:21:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 21:21:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 21:21:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 21:21:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 21:21:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 21:21:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-20 21:21:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-20 21:21:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-20 21:21:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 21:21:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 21:21:10,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 21:21:10,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 21:21:10,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 21:21:10,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 21:21:10,785 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 21:21:10,787 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 21:21:11,198 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-20 21:21:11,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 21:21:11,211 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 21:21:11,211 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-20 21:21:11,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:11 BoogieIcfgContainer [2024-11-20 21:21:11,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 21:21:11,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 21:21:11,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 21:21:11,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 21:21:11,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:21:09" (1/3) ... [2024-11-20 21:21:11,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5341004d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:21:11, skipping insertion in model container [2024-11-20 21:21:11,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:10" (2/3) ... [2024-11-20 21:21:11,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5341004d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:21:11, skipping insertion in model container [2024-11-20 21:21:11,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:11" (3/3) ... [2024-11-20 21:21:11,218 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid.i [2024-11-20 21:21:11,230 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 21:21:11,230 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-20 21:21:11,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 21:21:11,275 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;@6b59b03d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 21:21:11,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-20 21:21:11,279 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-20 21:21:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 21:21:11,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:11,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 21:21:11,284 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-20 21:21:11,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-20 21:21:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770415807] [2024-11-20 21:21:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:11,301 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-20 21:21:11,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:11,304 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-20 21:21:11,305 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-20 21:21:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:11,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 21:21:11,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:11,602 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-20 21:21:11,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:11,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:11,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770415807] [2024-11-20 21:21:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770415807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:11,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:11,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 21:21:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281559769] [2024-11-20 21:21:11,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:11,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 21:21:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:11,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 21:21:11,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 21:21:11,624 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-20 21:21:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:11,643 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-11-20 21:21:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 21:21:11,645 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-20 21:21:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:11,652 INFO L225 Difference]: With dead ends: 78 [2024-11-20 21:21:11,652 INFO L226 Difference]: Without dead ends: 34 [2024-11-20 21:21:11,654 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-20 21:21:11,656 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-20 21:21:11,660 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-20 21:21:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-20 21:21:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-20 21:21:11,684 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-20 21:21:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-20 21:21:11,685 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 4 [2024-11-20 21:21:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:11,685 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-20 21:21:11,685 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-20 21:21:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-20 21:21:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 21:21:11,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:11,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 21:21:11,698 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-20 21:21:11,887 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-20 21:21:11,887 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-20 21:21:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-20 21:21:11,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:11,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426044980] [2024-11-20 21:21:11,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:11,894 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-20 21:21:11,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:11,896 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-20 21:21:11,898 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-20 21:21:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:12,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:12,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:12,135 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-20 21:21:12,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:12,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426044980] [2024-11-20 21:21:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426044980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:12,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608594272] [2024-11-20 21:21:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:12,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:12,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:12,138 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-20 21:21:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:12,162 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-20 21:21:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:12,163 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-20 21:21:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:12,164 INFO L225 Difference]: With dead ends: 66 [2024-11-20 21:21:12,164 INFO L226 Difference]: Without dead ends: 37 [2024-11-20 21:21:12,164 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-20 21:21:12,165 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-20 21:21:12,165 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-20 21:21:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-20 21:21:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-20 21:21:12,169 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-20 21:21:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-20 21:21:12,169 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 5 [2024-11-20 21:21:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:12,170 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-20 21:21:12,170 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-20 21:21:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-20 21:21:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 21:21:12,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:12,170 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-20 21:21:12,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 21:21:12,374 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-20 21:21:12,375 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-20 21:21:12,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-20 21:21:12,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:12,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827138137] [2024-11-20 21:21:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:12,377 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-20 21:21:12,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:12,379 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-20 21:21:12,384 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-20 21:21:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:12,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:12,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:12,584 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-20 21:21:12,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:12,617 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-20 21:21:12,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:12,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827138137] [2024-11-20 21:21:12,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827138137] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:12,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:12,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-20 21:21:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065311249] [2024-11-20 21:21:12,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:12,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:12,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:12,619 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-20 21:21:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:12,689 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-20 21:21:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:12,690 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-20 21:21:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:12,691 INFO L225 Difference]: With dead ends: 69 [2024-11-20 21:21:12,691 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 21:21:12,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-20 21:21:12,693 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:12,694 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.0s Time] [2024-11-20 21:21:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 21:21:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-20 21:21:12,699 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-20 21:21:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-20 21:21:12,700 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2024-11-20 21:21:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:12,702 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-20 21:21:12,702 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-20 21:21:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-20 21:21:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 21:21:12,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:12,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:12,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:12,903 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-20 21:21:12,904 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-20 21:21:12,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1497124748, now seen corresponding path program 1 times [2024-11-20 21:21:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:12,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468394762] [2024-11-20 21:21:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:12,906 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-20 21:21:12,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:12,908 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-20 21:21:12,913 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-20 21:21:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:13,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:13,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:13,143 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-20 21:21:13,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:13,188 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-20 21:21:13,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:13,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468394762] [2024-11-20 21:21:13,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468394762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:13,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:13,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 21:21:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051626460] [2024-11-20 21:21:13,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:13,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:21:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:21:13,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:21:13,191 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-20 21:21:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:13,297 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-11-20 21:21:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:21:13,306 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-20 21:21:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:13,306 INFO L225 Difference]: With dead ends: 77 [2024-11-20 21:21:13,306 INFO L226 Difference]: Without dead ends: 49 [2024-11-20 21:21:13,307 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-20 21:21:13,307 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-20 21:21:13,308 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-20 21:21:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-20 21:21:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-20 21:21:13,315 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-20 21:21:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-20 21:21:13,316 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 17 [2024-11-20 21:21:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:13,320 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-20 21:21:13,320 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-20 21:21:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-20 21:21:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 21:21:13,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:13,321 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:13,333 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-20 21:21:13,521 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-20 21:21:13,522 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-20 21:21:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1161315828, now seen corresponding path program 2 times [2024-11-20 21:21:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837176938] [2024-11-20 21:21:13,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:13,523 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-20 21:21:13,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:13,530 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-20 21:21:13,532 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-20 21:21:13,713 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:13,713 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:13,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:13,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:13,752 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-20 21:21:13,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:13,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837176938] [2024-11-20 21:21:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837176938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:13,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:13,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 21:21:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406742257] [2024-11-20 21:21:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:13,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:21:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:13,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:21:13,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:21:13,754 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-20 21:21:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:14,000 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-20 21:21:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:21:14,001 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-20 21:21:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:14,002 INFO L225 Difference]: With dead ends: 49 [2024-11-20 21:21:14,002 INFO L226 Difference]: Without dead ends: 47 [2024-11-20 21:21:14,002 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-20 21:21:14,004 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:14,004 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.2s Time] [2024-11-20 21:21:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-20 21:21:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-20 21:21:14,013 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-20 21:21:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-20 21:21:14,014 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 29 [2024-11-20 21:21:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:14,015 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-20 21:21:14,015 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-20 21:21:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-20 21:21:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 21:21:14,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:14,016 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-20 21:21:14,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 21:21:14,216 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-20 21:21:14,217 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-20 21:21:14,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1704728544, now seen corresponding path program 1 times [2024-11-20 21:21:14,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:14,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431284560] [2024-11-20 21:21:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:14,218 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-20 21:21:14,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:14,221 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-20 21:21:14,222 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-20 21:21:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:14,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:21:14,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:14,529 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-20 21:21:14,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:14,654 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-20 21:21:14,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431284560] [2024-11-20 21:21:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431284560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:14,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 21:21:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443271456] [2024-11-20 21:21:14,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:14,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 21:21:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 21:21:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:14,656 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-20 21:21:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:14,934 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-11-20 21:21:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:14,940 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-20 21:21:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:14,940 INFO L225 Difference]: With dead ends: 85 [2024-11-20 21:21:14,940 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 21:21:14,941 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-20 21:21:14,941 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-20 21:21:14,941 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-20 21:21:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 21:21:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 21:21:14,951 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-20 21:21:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2024-11-20 21:21:14,956 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 35 [2024-11-20 21:21:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:14,957 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-11-20 21:21:14,957 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-20 21:21:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2024-11-20 21:21:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 21:21:14,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:14,958 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-20 21:21:14,972 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-20 21:21:15,158 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-20 21:21:15,158 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-20 21:21:15,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash -819573408, now seen corresponding path program 2 times [2024-11-20 21:21:15,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:15,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672200103] [2024-11-20 21:21:15,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:15,160 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-20 21:21:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:15,164 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-20 21:21:15,165 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-20 21:21:15,377 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:15,377 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:15,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:15,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:15,400 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-20 21:21:15,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:15,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672200103] [2024-11-20 21:21:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672200103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:15,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915665212] [2024-11-20 21:21:15,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:15,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:15,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:15,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:15,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:15,403 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-20 21:21:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:15,429 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-20 21:21:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:15,429 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-20 21:21:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:15,430 INFO L225 Difference]: With dead ends: 78 [2024-11-20 21:21:15,430 INFO L226 Difference]: Without dead ends: 62 [2024-11-20 21:21:15,430 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-20 21:21:15,431 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-20 21:21:15,431 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-20 21:21:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-20 21:21:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-20 21:21:15,435 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-20 21:21:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-11-20 21:21:15,438 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 47 [2024-11-20 21:21:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:15,438 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-11-20 21:21:15,438 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-20 21:21:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-11-20 21:21:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-20 21:21:15,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:15,439 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-20 21:21:15,449 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-20 21:21:15,639 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-20 21:21:15,639 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-20 21:21:15,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1670984743, now seen corresponding path program 1 times [2024-11-20 21:21:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239216701] [2024-11-20 21:21:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:15,640 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-20 21:21:15,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:15,643 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-20 21:21:15,644 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-20 21:21:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:15,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 21:21:15,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:15,942 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-20 21:21:15,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:15,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:15,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239216701] [2024-11-20 21:21:15,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239216701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:15,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:15,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 21:21:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579814860] [2024-11-20 21:21:15,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:15,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:15,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:15,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:15,944 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-20 21:21:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:16,165 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-20 21:21:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:16,166 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-20 21:21:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:16,167 INFO L225 Difference]: With dead ends: 81 [2024-11-20 21:21:16,167 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 21:21:16,167 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-20 21:21:16,167 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:16,168 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.2s Time] [2024-11-20 21:21:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 21:21:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-20 21:21:16,175 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-20 21:21:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-20 21:21:16,176 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 49 [2024-11-20 21:21:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:16,176 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-20 21:21:16,176 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-20 21:21:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-20 21:21:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:21:16,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:16,177 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-20 21:21:16,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:16,381 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-20 21:21:16,382 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-20 21:21:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash 977761556, now seen corresponding path program 1 times [2024-11-20 21:21:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:16,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600983592] [2024-11-20 21:21:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:16,383 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-20 21:21:16,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:16,384 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:16,387 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-20 21:21:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:16,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:16,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:16,692 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-20 21:21:16,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:16,723 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-20 21:21:16,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:16,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600983592] [2024-11-20 21:21:16,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600983592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:16,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:16,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-20 21:21:16,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725638606] [2024-11-20 21:21:16,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:16,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:16,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:16,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:16,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:16,725 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-20 21:21:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:16,827 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-11-20 21:21:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:16,828 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-20 21:21:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:16,829 INFO L225 Difference]: With dead ends: 101 [2024-11-20 21:21:16,829 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 21:21:16,829 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-20 21:21:16,829 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:16,829 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.1s Time] [2024-11-20 21:21:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 21:21:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-11-20 21:21:16,835 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-20 21:21:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-20 21:21:16,835 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 50 [2024-11-20 21:21:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:16,836 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-20 21:21:16,836 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-20 21:21:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-20 21:21:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 21:21:16,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:16,837 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-20 21:21:16,849 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-20 21:21:17,040 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-20 21:21:17,041 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-20 21:21:17,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash -67955900, now seen corresponding path program 1 times [2024-11-20 21:21:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:17,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164320097] [2024-11-20 21:21:17,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:17,042 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-20 21:21:17,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:17,044 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-20 21:21:17,045 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-20 21:21:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:17,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:17,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:17,355 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-20 21:21:17,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:17,394 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-20 21:21:17,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164320097] [2024-11-20 21:21:17,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164320097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:17,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 21:21:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833824350] [2024-11-20 21:21:17,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:17,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:21:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:17,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:21:17,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:21:17,396 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-20 21:21:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:17,574 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2024-11-20 21:21:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:21:17,574 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-20 21:21:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:17,575 INFO L225 Difference]: With dead ends: 119 [2024-11-20 21:21:17,575 INFO L226 Difference]: Without dead ends: 97 [2024-11-20 21:21:17,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:21:17,575 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 21:21:17,575 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-20 21:21:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-20 21:21:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-20 21:21:17,585 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-20 21:21:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-20 21:21:17,586 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 60 [2024-11-20 21:21:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:17,586 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-20 21:21:17,586 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-20 21:21:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-20 21:21:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-20 21:21:17,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:17,588 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-20 21:21:17,599 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-20 21:21:17,791 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-20 21:21:17,792 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-20 21:21:17,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 734669892, now seen corresponding path program 2 times [2024-11-20 21:21:17,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:17,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582629449] [2024-11-20 21:21:17,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:17,793 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-20 21:21:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:17,795 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-20 21:21:17,796 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-20 21:21:20,789 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 21:21:20,789 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:20,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:21:20,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:20,873 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-20 21:21:20,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:21,000 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-20 21:21:21,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:21,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582629449] [2024-11-20 21:21:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582629449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:21,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:21,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 21:21:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821642665] [2024-11-20 21:21:21,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:21,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 21:21:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 21:21:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:21,002 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-20 21:21:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:21,498 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-20 21:21:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:21,498 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-20 21:21:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:21,500 INFO L225 Difference]: With dead ends: 155 [2024-11-20 21:21:21,500 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 21:21:21,501 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-20 21:21:21,501 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:21,502 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.4s Time] [2024-11-20 21:21:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 21:21:21,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-20 21:21:21,516 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-20 21:21:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2024-11-20 21:21:21,517 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 72 [2024-11-20 21:21:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:21,517 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2024-11-20 21:21:21,517 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-20 21:21:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2024-11-20 21:21:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 21:21:21,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:21,522 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-20 21:21:21,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:21,722 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-20 21:21:21,723 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-20 21:21:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash 482592068, now seen corresponding path program 3 times [2024-11-20 21:21:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802629434] [2024-11-20 21:21:21,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 21:21:21,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:21,727 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-20 21:21:21,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 21:21:33,325 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-20 21:21:33,325 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-20 21:21:33,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 21:21:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 21:21:38,675 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 21:21:38,675 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 21:21:38,676 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 13 remaining) [2024-11-20 21:21:38,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2024-11-20 21:21:38,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2024-11-20 21:21:38,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2024-11-20 21:21:38,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2024-11-20 21:21:38,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2024-11-20 21:21:38,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2024-11-20 21:21:38,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2024-11-20 21:21:38,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2024-11-20 21:21:38,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2024-11-20 21:21:38,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2024-11-20 21:21:38,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2024-11-20 21:21:38,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2024-11-20 21:21:38,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:38,879 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-20 21:21:38,882 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-20 21:21:38,944 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 21:21:38,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:21:38 BoogieIcfgContainer [2024-11-20 21:21:38,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 21:21:38,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 21:21:38,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 21:21:38,952 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 21:21:38,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:11" (3/4) ... [2024-11-20 21:21:38,954 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 21:21:38,956 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 21:21:38,956 INFO L158 Benchmark]: Toolchain (without parser) took 29823.55ms. Allocated memory was 81.8MB in the beginning and 247.5MB in the end (delta: 165.7MB). Free memory was 39.4MB in the beginning and 128.9MB in the end (delta: -89.5MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2024-11-20 21:21:38,956 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 81.8MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 21:21:38,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1113.75ms. Allocated memory was 81.8MB in the beginning and 163.6MB in the end (delta: 81.8MB). Free memory was 39.0MB in the beginning and 91.9MB in the end (delta: -52.8MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2024-11-20 21:21:38,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.61ms. Allocated memory is still 163.6MB. Free memory was 91.9MB in the beginning and 84.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 21:21:38,957 INFO L158 Benchmark]: Boogie Preprocessor took 95.49ms. Allocated memory is still 163.6MB. Free memory was 84.8MB in the beginning and 124.1MB in the end (delta: -39.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 21:21:38,958 INFO L158 Benchmark]: RCFGBuilder took 790.02ms. Allocated memory is still 163.6MB. Free memory was 124.1MB in the beginning and 115.3MB in the end (delta: 8.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-20 21:21:38,958 INFO L158 Benchmark]: TraceAbstraction took 27738.29ms. Allocated memory was 163.6MB in the beginning and 247.5MB in the end (delta: 83.9MB). Free memory was 115.3MB in the beginning and 130.0MB in the end (delta: -14.7MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-11-20 21:21:38,958 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 247.5MB. Free memory was 130.0MB in the beginning and 128.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 21:21:38,959 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.72ms. Allocated memory is still 81.8MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1113.75ms. Allocated memory was 81.8MB in the beginning and 163.6MB in the end (delta: 81.8MB). Free memory was 39.0MB in the beginning and 91.9MB in the end (delta: -52.8MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.61ms. Allocated memory is still 163.6MB. Free memory was 91.9MB in the beginning and 84.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.49ms. Allocated memory is still 163.6MB. Free memory was 84.8MB in the beginning and 124.1MB in the end (delta: -39.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 790.02ms. Allocated memory is still 163.6MB. Free memory was 124.1MB in the beginning and 115.3MB in the end (delta: 8.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27738.29ms. Allocated memory was 163.6MB in the beginning and 247.5MB in the end (delta: 83.9MB). Free memory was 115.3MB in the beginning and 130.0MB in the end (delta: -14.7MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 247.5MB. Free memory was 130.0MB in the beginning and 128.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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