./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/basename-2.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/basename-2.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 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 21:20:33,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 21:20:33,097 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:33,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 21:20:33,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 21:20:33,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 21:20:33,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 21:20:33,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 21:20:33,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 21:20:33,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 21:20:33,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 21:20:33,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 21:20:33,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 21:20:33,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 21:20:33,127 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 21:20:33,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 21:20:33,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 21:20:33,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 21:20:33,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 21:20:33,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 21:20:33,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 21:20:33,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 21:20:33,130 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 21:20:33,130 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 21:20:33,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 21:20:33,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 21:20:33,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 21:20:33,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 21:20:33,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 21:20:33,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 21:20:33,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 21:20:33,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:20:33,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 21:20:33,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 21:20:33,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 21:20:33,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 21:20:33,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 21:20:33,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 21:20:33,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 21:20:33,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 21:20:33,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 21:20:33,136 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 -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2024-11-20 21:20:33,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 21:20:33,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 21:20:33,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 21:20:33,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 21:20:33,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 21:20:33,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-20 21:20:34,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 21:20:35,261 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 21:20:35,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-20 21:20:35,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8226d6a0/5929026b758e4873aad64c1c86ec1da4/FLAGea038db3a [2024-11-20 21:20:35,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8226d6a0/5929026b758e4873aad64c1c86ec1da4 [2024-11-20 21:20:35,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 21:20:35,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 21:20:35,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 21:20:35,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 21:20:35,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 21:20:35,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:20:35" (1/1) ... [2024-11-20 21:20:35,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49854962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:35, skipping insertion in model container [2024-11-20 21:20:35,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:20:35" (1/1) ... [2024-11-20 21:20:35,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 21:20:36,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:20:36,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 21:20:36,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:20:36,524 INFO L204 MainTranslator]: Completed translation [2024-11-20 21:20:36,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:36 WrapperNode [2024-11-20 21:20:36,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 21:20:36,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 21:20:36,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 21:20:36,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 21:20:36,532 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:36" (1/1) ... [2024-11-20 21:20:36,563 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:36" (1/1) ... [2024-11-20 21:20:36,624 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 742 [2024-11-20 21:20:36,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 21:20:36,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 21:20:36,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 21:20:36,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 21:20:36,640 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:36" (1/1) ... [2024-11-20 21:20:36,641 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:36" (1/1) ... [2024-11-20 21:20:36,649 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:36" (1/1) ... [2024-11-20 21:20:36,685 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 2, 3, 3, 4, 4, 4, 3, 3, 355, 12, 2, 12]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 0, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0]. The 11 writes are split as follows [0, 0, 2, 0, 0, 0, 0, 0, 0, 1, 0, 5, 1, 2]. [2024-11-20 21:20:36,686 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:36" (1/1) ... [2024-11-20 21:20:36,686 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:36" (1/1) ... [2024-11-20 21:20:36,716 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:36" (1/1) ... [2024-11-20 21:20:36,723 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:36" (1/1) ... [2024-11-20 21:20:36,733 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:36" (1/1) ... [2024-11-20 21:20:36,741 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:36" (1/1) ... [2024-11-20 21:20:36,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 21:20:36,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 21:20:36,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 21:20:36,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 21:20:36,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:36" (1/1) ... [2024-11-20 21:20:36,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:20:36,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:36,803 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:36,809 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:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 21:20:36,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-20 21:20:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 21:20:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 21:20:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 21:20:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 21:20:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 21:20:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-20 21:20:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-20 21:20:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-20 21:20:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-20 21:20:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-20 21:20:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-20 21:20:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-20 21:20:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-20 21:20:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 21:20:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 21:20:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 21:20:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 21:20:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 21:20:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 21:20:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-20 21:20:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-20 21:20:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-20 21:20:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-20 21:20:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-20 21:20:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-20 21:20:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-20 21:20:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-20 21:20:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 21:20:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 21:20:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 21:20:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 21:20:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 21:20:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-20 21:20:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-20 21:20:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-20 21:20:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-20 21:20:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-20 21:20:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-20 21:20:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-20 21:20:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-20 21:20:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-20 21:20:36,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-20 21:20:36,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-20 21:20:36,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 21:20:36,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 21:20:36,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-20 21:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-20 21:20:36,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-20 21:20:36,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 21:20:36,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 21:20:37,280 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 21:20:37,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 21:20:37,927 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-11-20 21:20:37,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 21:20:37,945 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 21:20:37,946 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-20 21:20:37,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:37 BoogieIcfgContainer [2024-11-20 21:20:37,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 21:20:37,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 21:20:37,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 21:20:37,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 21:20:37,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:20:35" (1/3) ... [2024-11-20 21:20:37,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f3b88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:20:37, skipping insertion in model container [2024-11-20 21:20:37,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:36" (2/3) ... [2024-11-20 21:20:37,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f3b88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:20:37, skipping insertion in model container [2024-11-20 21:20:37,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:37" (3/3) ... [2024-11-20 21:20:37,958 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-20 21:20:37,976 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 21:20:37,976 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-20 21:20:38,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 21:20:38,058 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;@e0e01c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 21:20:38,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-20 21:20:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 118 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 21:20:38,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:38,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 21:20:38,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:38,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-20 21:20:38,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895533136] [2024-11-20 21:20:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:38,803 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:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:38,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895533136] [2024-11-20 21:20:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895533136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:38,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954546513] [2024-11-20 21:20:38,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:38,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:38,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:38,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:38,849 INFO L87 Difference]: Start difference. First operand has 122 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 118 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:38,942 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2024-11-20 21:20:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:38,946 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:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:38,957 INFO L225 Difference]: With dead ends: 241 [2024-11-20 21:20:38,957 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 21:20:38,960 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:38,964 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 292 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:20:38,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 292 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 21:20:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-20 21:20:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 115 states have internal predecessors, (146), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2024-11-20 21:20:39,014 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 4 [2024-11-20 21:20:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:39,014 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2024-11-20 21:20:39,014 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:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2024-11-20 21:20:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 21:20:39,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:39,015 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-20 21:20:39,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 21:20:39,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:39,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-20 21:20:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:39,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590858671] [2024-11-20 21:20:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:39,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:39,265 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:39,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:39,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590858671] [2024-11-20 21:20:39,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590858671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140485490] [2024-11-20 21:20:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:39,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:39,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:39,271 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:39,273 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:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:39,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:39,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:39,666 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:39,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140485490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:39,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:39,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-20 21:20:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981965745] [2024-11-20 21:20:39,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:39,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:39,671 INFO L87 Difference]: Start difference. First operand 119 states and 150 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:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:39,716 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2024-11-20 21:20:39,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:39,717 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:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:39,718 INFO L225 Difference]: With dead ends: 119 [2024-11-20 21:20:39,719 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 21:20:39,719 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:39,720 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 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:39,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 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:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 21:20:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-20 21:20:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.576086956521739) internal successors, (145), 114 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2024-11-20 21:20:39,730 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 7 [2024-11-20 21:20:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:39,731 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2024-11-20 21:20:39,731 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:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2024-11-20 21:20:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 21:20:39,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:39,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-20 21:20:39,744 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:39,932 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:39,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:39,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-20 21:20:39,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:39,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251088426] [2024-11-20 21:20:39,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:39,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:40,063 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:40,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:40,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251088426] [2024-11-20 21:20:40,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251088426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:40,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:40,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:40,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789703510] [2024-11-20 21:20:40,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:40,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:40,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:40,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:40,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:40,066 INFO L87 Difference]: Start difference. First operand 118 states and 149 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:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:40,091 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2024-11-20 21:20:40,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:40,092 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:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:40,094 INFO L225 Difference]: With dead ends: 118 [2024-11-20 21:20:40,098 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 21:20:40,098 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:40,099 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 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:40,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 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:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 21:20:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-11-20 21:20:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 90 states have (on average 1.5777777777777777) internal successors, (142), 111 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2024-11-20 21:20:40,117 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 8 [2024-11-20 21:20:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:40,117 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2024-11-20 21:20:40,117 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:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2024-11-20 21:20:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 21:20:40,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:40,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:40,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 21:20:40,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:40,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:40,119 INFO L85 PathProgramCache]: Analyzing trace with hash -757917108, now seen corresponding path program 1 times [2024-11-20 21:20:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:40,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811088840] [2024-11-20 21:20:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:40,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-20 21:20:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:40,319 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:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811088840] [2024-11-20 21:20:40,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811088840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:40,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222951706] [2024-11-20 21:20:40,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:40,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:40,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:40,327 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:40,343 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:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:40,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:20:40,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:40,634 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:40,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:40,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222951706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:40,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:40,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-20 21:20:40,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338432253] [2024-11-20 21:20:40,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:40,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:40,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:40,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:40,636 INFO L87 Difference]: Start difference. First operand 115 states and 146 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:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:40,672 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2024-11-20 21:20:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:40,672 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:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:40,673 INFO L225 Difference]: With dead ends: 115 [2024-11-20 21:20:40,674 INFO L226 Difference]: Without dead ends: 113 [2024-11-20 21:20:40,674 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:40,675 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 127 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:40,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 143 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-20 21:20:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-20 21:20:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 109 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2024-11-20 21:20:40,693 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 13 [2024-11-20 21:20:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:40,696 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2024-11-20 21:20:40,697 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:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2024-11-20 21:20:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 21:20:40,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:40,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:40,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 21:20:40,898 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:40,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:40,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2020593806, now seen corresponding path program 1 times [2024-11-20 21:20:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:40,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486264277] [2024-11-20 21:20:40,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-20 21:20:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:41,080 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:41,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486264277] [2024-11-20 21:20:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486264277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41161318] [2024-11-20 21:20:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:41,085 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:41,086 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:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:41,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:41,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:41,368 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:41,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:41,399 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:41,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41161318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:41,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 21:20:41,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022357266] [2024-11-20 21:20:41,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:41,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:41,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:41,404 INFO L87 Difference]: Start difference. First operand 113 states and 144 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:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:41,452 INFO L93 Difference]: Finished difference Result 229 states and 293 transitions. [2024-11-20 21:20:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:41,453 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:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:41,454 INFO L225 Difference]: With dead ends: 229 [2024-11-20 21:20:41,454 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 21:20:41,455 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:41,456 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:41,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 688 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 21:20:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-20 21:20:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.505050505050505) internal successors, (149), 118 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2024-11-20 21:20:41,473 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 14 [2024-11-20 21:20:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:41,474 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2024-11-20 21:20:41,474 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:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2024-11-20 21:20:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 21:20:41,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:41,476 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:41,487 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:41,676 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:41,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:41,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1267261696, now seen corresponding path program 2 times [2024-11-20 21:20:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251106618] [2024-11-20 21:20:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:41,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:20:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:41,956 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:20:41,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251106618] [2024-11-20 21:20:41,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251106618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:41,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142892408] [2024-11-20 21:20:41,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:41,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:41,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:41,961 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:20:41,964 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:20:42,255 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:20:42,256 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:42,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:20:42,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:42,319 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:20:42,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142892408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:42,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:42,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 21:20:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105744347] [2024-11-20 21:20:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:42,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:20:42,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:42,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:20:42,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:20:42,321 INFO L87 Difference]: Start difference. First operand 122 states and 153 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:20:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:42,379 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2024-11-20 21:20:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:20:42,380 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:20:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:42,382 INFO L225 Difference]: With dead ends: 122 [2024-11-20 21:20:42,382 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 21:20:42,382 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:20:42,383 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 126 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:42,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 392 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 21:20:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-20 21:20:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 116 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-11-20 21:20:42,398 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 23 [2024-11-20 21:20:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:42,398 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-11-20 21:20:42,399 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:20:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-11-20 21:20:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 21:20:42,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:42,400 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:20:42,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 21:20:42,601 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:20:42,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1741242827, now seen corresponding path program 1 times [2024-11-20 21:20:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206496338] [2024-11-20 21:20:42,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:42,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:20:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:42,799 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:20:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:42,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206496338] [2024-11-20 21:20:42,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206496338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:42,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:42,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:42,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497681136] [2024-11-20 21:20:42,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:42,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:42,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:42,802 INFO L87 Difference]: Start difference. First operand 120 states and 151 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:20:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:42,829 INFO L93 Difference]: Finished difference Result 222 states and 285 transitions. [2024-11-20 21:20:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:42,829 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:20:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:42,831 INFO L225 Difference]: With dead ends: 222 [2024-11-20 21:20:42,831 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 21:20:42,832 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:20:42,834 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 270 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:20:42,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 270 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 21:20:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-20 21:20:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 119 states have internal predecessors, (150), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2024-11-20 21:20:42,846 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 28 [2024-11-20 21:20:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:42,847 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2024-11-20 21:20:42,847 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:20:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2024-11-20 21:20:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 21:20:42,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:42,851 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:42,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 21:20:42,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1249855697, now seen corresponding path program 1 times [2024-11-20 21:20:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:42,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914481044] [2024-11-20 21:20:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:20:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-20 21:20:43,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914481044] [2024-11-20 21:20:43,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914481044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9595089] [2024-11-20 21:20:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:43,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:43,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:43,072 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:20:43,075 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:20:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:43,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:20:43,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 21:20:43,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 21:20:43,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9595089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:43,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:43,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-20 21:20:43,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399321341] [2024-11-20 21:20:43,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:43,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 21:20:43,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 21:20:43,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-20 21:20:43,535 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 21:20:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:43,641 INFO L93 Difference]: Finished difference Result 248 states and 316 transitions. [2024-11-20 21:20:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 21:20:43,642 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-20 21:20:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:43,643 INFO L225 Difference]: With dead ends: 248 [2024-11-20 21:20:43,643 INFO L226 Difference]: Without dead ends: 140 [2024-11-20 21:20:43,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-20 21:20:43,644 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 5 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:43,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 777 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:20:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-20 21:20:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-20 21:20:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 136 states have internal predecessors, (167), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2024-11-20 21:20:43,651 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 31 [2024-11-20 21:20:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:43,651 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2024-11-20 21:20:43,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 21:20:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2024-11-20 21:20:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:20:43,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:43,653 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] [2024-11-20 21:20:43,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:43,857 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:20:43,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:43,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:43,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2012171647, now seen corresponding path program 1 times [2024-11-20 21:20:43,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:43,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166902278] [2024-11-20 21:20:43,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:43,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,042 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:20:44,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166902278] [2024-11-20 21:20:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166902278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:44,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:44,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347894700] [2024-11-20 21:20:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:44,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:44,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:44,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:44,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:44,045 INFO L87 Difference]: Start difference. First operand 140 states and 171 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:20:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:44,064 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2024-11-20 21:20:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:44,065 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:20:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:44,066 INFO L225 Difference]: With dead ends: 145 [2024-11-20 21:20:44,067 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 21:20:44,068 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:20:44,069 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 270 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:20:44,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 270 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 21:20:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-20 21:20:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 139 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2024-11-20 21:20:44,076 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 50 [2024-11-20 21:20:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:44,077 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2024-11-20 21:20:44,077 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:20:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2024-11-20 21:20:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:20:44,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:44,080 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] [2024-11-20 21:20:44,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 21:20:44,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:44,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2099130704, now seen corresponding path program 1 times [2024-11-20 21:20:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:44,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998684098] [2024-11-20 21:20:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,338 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:20:44,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:44,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998684098] [2024-11-20 21:20:44,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998684098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:44,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:44,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:20:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034759287] [2024-11-20 21:20:44,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:44,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:44,340 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand has 3 states, 3 states have (on average 7.0) 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:20:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:44,350 INFO L93 Difference]: Finished difference Result 206 states and 257 transitions. [2024-11-20 21:20:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:44,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) 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:20:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:44,352 INFO L225 Difference]: With dead ends: 206 [2024-11-20 21:20:44,352 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 21:20:44,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:44,353 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:44,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 21:20:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-20 21:20:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 116 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2024-11-20 21:20:44,358 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 50 [2024-11-20 21:20:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:44,359 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2024-11-20 21:20:44,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) 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:20:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2024-11-20 21:20:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:20:44,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:44,363 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] [2024-11-20 21:20:44,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 21:20:44,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:44,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash -856729593, now seen corresponding path program 1 times [2024-11-20 21:20:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:44,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209605412] [2024-11-20 21:20:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-20 21:20:44,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:44,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209605412] [2024-11-20 21:20:44,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209605412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:44,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713935993] [2024-11-20 21:20:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:44,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:44,558 INFO L87 Difference]: Start difference. First operand 120 states and 145 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:20:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:44,587 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2024-11-20 21:20:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:44,588 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:20:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:44,589 INFO L225 Difference]: With dead ends: 133 [2024-11-20 21:20:44,589 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 21:20:44,590 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:20:44,590 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:44,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 21:20:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-20 21:20:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.305084745762712) internal successors, (154), 126 states have internal predecessors, (154), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2024-11-20 21:20:44,596 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 50 [2024-11-20 21:20:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:44,596 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2024-11-20 21:20:44,596 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:20:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2024-11-20 21:20:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:20:44,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:44,597 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:20:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 21:20:44,598 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:44,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash -856727864, now seen corresponding path program 1 times [2024-11-20 21:20:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227086387] [2024-11-20 21:20:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,795 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:20:44,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:44,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227086387] [2024-11-20 21:20:44,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227086387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:44,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:44,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386889837] [2024-11-20 21:20:44,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:44,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:44,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:44,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:44,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:44,797 INFO L87 Difference]: Start difference. First operand 130 states and 158 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:20:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:44,813 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2024-11-20 21:20:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:44,814 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:20:44,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:44,815 INFO L225 Difference]: With dead ends: 130 [2024-11-20 21:20:44,815 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 21:20:44,815 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:20:44,815 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 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:20:44,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 21:20:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2024-11-20 21:20:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 121 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2024-11-20 21:20:44,821 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 50 [2024-11-20 21:20:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:44,822 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2024-11-20 21:20:44,822 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:20:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2024-11-20 21:20:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-20 21:20:44,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:44,823 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] [2024-11-20 21:20:44,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 21:20:44,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:44,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1371935090, now seen corresponding path program 1 times [2024-11-20 21:20:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257651113] [2024-11-20 21:20:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,272 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:20:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257651113] [2024-11-20 21:20:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257651113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:45,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:45,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 21:20:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119503032] [2024-11-20 21:20:45,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:45,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:20:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:20:45,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:20:45,275 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:45,354 INFO L93 Difference]: Finished difference Result 193 states and 241 transitions. [2024-11-20 21:20:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 52 [2024-11-20 21:20:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:45,356 INFO L225 Difference]: With dead ends: 193 [2024-11-20 21:20:45,356 INFO L226 Difference]: Without dead ends: 125 [2024-11-20 21:20:45,356 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:20:45,357 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:45,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 373 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:20:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-20 21:20:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-20 21:20:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 121 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2024-11-20 21:20:45,364 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 52 [2024-11-20 21:20:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:45,365 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2024-11-20 21:20:45,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2024-11-20 21:20:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 21:20:45,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:45,367 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:45,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 21:20:45,367 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:45,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash -776451536, now seen corresponding path program 1 times [2024-11-20 21:20:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178581650] [2024-11-20 21:20:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-20 21:20:45,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:45,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178581650] [2024-11-20 21:20:45,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178581650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:45,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731695597] [2024-11-20 21:20:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:45,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:45,600 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:20:45,602 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:20:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:45,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-20 21:20:46,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-20 21:20:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731695597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:46,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 21:20:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400584644] [2024-11-20 21:20:46,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:46,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:46,037 INFO L87 Difference]: Start difference. First operand 125 states and 151 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:20:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:46,078 INFO L93 Difference]: Finished difference Result 224 states and 279 transitions. [2024-11-20 21:20:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:46,079 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 58 [2024-11-20 21:20:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:46,080 INFO L225 Difference]: With dead ends: 224 [2024-11-20 21:20:46,080 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 21:20:46,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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:46,081 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:46,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 519 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 21:20:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-20 21:20:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 132 states have (on average 1.25) internal successors, (165), 139 states have internal predecessors, (165), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2024-11-20 21:20:46,087 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 58 [2024-11-20 21:20:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:46,087 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2024-11-20 21:20:46,088 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:20:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2024-11-20 21:20:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 21:20:46,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:46,088 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, 1, 1, 1] [2024-11-20 21:20:46,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:46,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:46,289 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:46,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2094163647, now seen corresponding path program 1 times [2024-11-20 21:20:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:46,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697224886] [2024-11-20 21:20:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:46,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:46,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:46,574 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:20:46,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697224886] [2024-11-20 21:20:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697224886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494745459] [2024-11-20 21:20:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:46,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:46,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:46,578 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:20:46,579 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:20:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:46,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:20:46,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:47,013 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:20:47,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:47,087 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:20:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494745459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:47,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-20 21:20:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6219872] [2024-11-20 21:20:47,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:47,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 21:20:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:47,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 21:20:47,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:20:47,090 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:47,149 INFO L93 Difference]: Finished difference Result 269 states and 330 transitions. [2024-11-20 21:20:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:20:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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) Word has length 69 [2024-11-20 21:20:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:47,150 INFO L225 Difference]: With dead ends: 269 [2024-11-20 21:20:47,150 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 21:20:47,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 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:20:47,151 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:47,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:47,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 21:20:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-20 21:20:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 168 states have (on average 1.1964285714285714) internal successors, (201), 175 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2024-11-20 21:20:47,159 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 69 [2024-11-20 21:20:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:47,159 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2024-11-20 21:20:47,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 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:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2024-11-20 21:20:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-20 21:20:47,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:47,160 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, 1, 1, 1] [2024-11-20 21:20:47,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 21:20:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:47,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:47,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 89302591, now seen corresponding path program 2 times [2024-11-20 21:20:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:47,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574969581] [2024-11-20 21:20:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-20 21:20:47,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574969581] [2024-11-20 21:20:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574969581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560879210] [2024-11-20 21:20:47,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:47,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:47,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:47,759 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:20:47,760 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:20:48,124 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:20:48,124 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:48,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:20:48,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 21:20:48,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560879210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:48,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-20 21:20:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323036082] [2024-11-20 21:20:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:48,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:20:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:20:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 21:20:48,331 INFO L87 Difference]: Start difference. First operand 179 states and 205 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:48,413 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2024-11-20 21:20:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 87 [2024-11-20 21:20:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:48,415 INFO L225 Difference]: With dead ends: 181 [2024-11-20 21:20:48,415 INFO L226 Difference]: Without dead ends: 180 [2024-11-20 21:20:48,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:20:48,415 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 89 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:48,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 365 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:20:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-20 21:20:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-11-20 21:20:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 174 states have internal predecessors, (200), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2024-11-20 21:20:48,424 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 87 [2024-11-20 21:20:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:48,424 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2024-11-20 21:20:48,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2024-11-20 21:20:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 21:20:48,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:48,425 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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, 1, 1] [2024-11-20 21:20:48,436 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:20:48,626 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,SelfDestructingSolverStorable15 [2024-11-20 21:20:48,626 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:48,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash -853525022, now seen corresponding path program 1 times [2024-11-20 21:20:48,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:48,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005854284] [2024-11-20 21:20:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:48,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 21:20:48,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:48,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005854284] [2024-11-20 21:20:48,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005854284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:48,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081013482] [2024-11-20 21:20:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:48,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:48,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:48,888 INFO L229 MonitoredProcess]: Starting monitored process 10 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:48,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 21:20:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:49,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:49,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 21:20:49,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:49,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081013482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:49,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:49,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-20 21:20:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198489702] [2024-11-20 21:20:49,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:49,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:49,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:49,439 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:49,468 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2024-11-20 21:20:49,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:49,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 88 [2024-11-20 21:20:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:49,470 INFO L225 Difference]: With dead ends: 178 [2024-11-20 21:20:49,470 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 21:20:49,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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:49,472 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 308 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:49,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 308 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:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 21:20:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-20 21:20:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 173 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2024-11-20 21:20:49,482 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 88 [2024-11-20 21:20:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:49,483 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2024-11-20 21:20:49,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2024-11-20 21:20:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 21:20:49,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:49,484 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, 1, 1, 1, 1] [2024-11-20 21:20:49,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 21:20:49,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:49,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1526586787, now seen corresponding path program 1 times [2024-11-20 21:20:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913912517] [2024-11-20 21:20:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:50,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 21:20:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913912517] [2024-11-20 21:20:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913912517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:50,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:20:50,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210600257] [2024-11-20 21:20:50,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:50,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 21:20:50,034 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:50,075 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2024-11-20 21:20:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 88 [2024-11-20 21:20:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:50,077 INFO L225 Difference]: With dead ends: 177 [2024-11-20 21:20:50,077 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 21:20:50,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:50,078 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:50,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 195 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 21:20:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-20 21:20:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 168 states have (on average 1.1785714285714286) internal successors, (198), 172 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions. [2024-11-20 21:20:50,085 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 88 [2024-11-20 21:20:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:50,085 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions. [2024-11-20 21:20:50,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions. [2024-11-20 21:20:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 21:20:50,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:50,087 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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, 1] [2024-11-20 21:20:50,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 21:20:50,087 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:50,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash -689471541, now seen corresponding path program 1 times [2024-11-20 21:20:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:50,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038907724] [2024-11-20 21:20:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:50,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 21:20:50,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038907724] [2024-11-20 21:20:50,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038907724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:50,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224973437] [2024-11-20 21:20:50,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:50,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:50,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:50,321 INFO L229 MonitoredProcess]: Starting monitored process 11 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:50,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-20 21:20:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:50,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:50,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 21:20:50,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 21:20:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224973437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:50,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-20 21:20:50,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200446289] [2024-11-20 21:20:50,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:50,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:50,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:50,849 INFO L87 Difference]: Start difference. First operand 176 states and 202 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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:20:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:50,881 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2024-11-20 21:20:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:50,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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) Word has length 89 [2024-11-20 21:20:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:50,882 INFO L225 Difference]: With dead ends: 186 [2024-11-20 21:20:50,883 INFO L226 Difference]: Without dead ends: 185 [2024-11-20 21:20:50,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 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:50,883 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:50,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-20 21:20:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-20 21:20:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 177 states have (on average 1.1694915254237288) internal successors, (207), 181 states have internal predecessors, (207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2024-11-20 21:20:50,891 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 89 [2024-11-20 21:20:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:50,891 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2024-11-20 21:20:50,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 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:20:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2024-11-20 21:20:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 21:20:50,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:50,892 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 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:20:50,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:51,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:51,096 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:51,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -703292001, now seen corresponding path program 2 times [2024-11-20 21:20:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572595836] [2024-11-20 21:20:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-20 21:20:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572595836] [2024-11-20 21:20:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572595836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595423772] [2024-11-20 21:20:51,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:51,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:51,422 INFO L229 MonitoredProcess]: Starting monitored process 12 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:51,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 21:20:51,867 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:20:51,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:51,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:51,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-20 21:20:51,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-20 21:20:52,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595423772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:52,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-20 21:20:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65966498] [2024-11-20 21:20:52,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:52,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:20:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:20:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:20:52,049 INFO L87 Difference]: Start difference. First operand 185 states and 211 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 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:20:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:52,104 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2024-11-20 21:20:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 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 98 [2024-11-20 21:20:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:52,106 INFO L225 Difference]: With dead ends: 185 [2024-11-20 21:20:52,106 INFO L226 Difference]: Without dead ends: 165 [2024-11-20 21:20:52,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:20:52,106 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 73 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:52,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 304 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-20 21:20:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-20 21:20:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 158 states have (on average 1.1582278481012658) internal successors, (183), 161 states have internal predecessors, (183), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2024-11-20 21:20:52,117 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 98 [2024-11-20 21:20:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:52,117 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2024-11-20 21:20:52,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 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:20:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2024-11-20 21:20:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 21:20:52,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:52,120 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:52,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-20 21:20:52,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:52,321 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:52,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1799807557, now seen corresponding path program 1 times [2024-11-20 21:20:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:52,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440571550] [2024-11-20 21:20:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 21:20:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-20 21:20:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440571550] [2024-11-20 21:20:52,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440571550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:52,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:52,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:20:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766004002] [2024-11-20 21:20:52,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 21:20:52,644 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:52,665 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2024-11-20 21:20:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-20 21:20:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:52,667 INFO L225 Difference]: With dead ends: 178 [2024-11-20 21:20:52,667 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 21:20:52,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 21:20:52,668 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:52,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 268 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 21:20:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2024-11-20 21:20:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 168 states have (on average 1.1607142857142858) internal successors, (195), 171 states have internal predecessors, (195), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:20:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2024-11-20 21:20:52,675 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 110 [2024-11-20 21:20:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:52,676 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2024-11-20 21:20:52,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2024-11-20 21:20:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 21:20:52,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:52,677 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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:20:52,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 21:20:52,677 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:52,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:52,678 INFO L85 PathProgramCache]: Analyzing trace with hash 40540923, now seen corresponding path program 1 times [2024-11-20 21:20:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:52,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695604256] [2024-11-20 21:20:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:52,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 21:20:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-20 21:20:52,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:52,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695604256] [2024-11-20 21:20:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695604256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:52,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:20:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607419188] [2024-11-20 21:20:52,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:52,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:20:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:52,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:20:52,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:52,997 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 21:20:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:53,024 INFO L93 Difference]: Finished difference Result 212 states and 243 transitions. [2024-11-20 21:20:53,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:20:53,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2024-11-20 21:20:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:53,026 INFO L225 Difference]: With dead ends: 212 [2024-11-20 21:20:53,026 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 21:20:53,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:20:53,027 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:53,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 376 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 21:20:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2024-11-20 21:20:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 170 states have (on average 1.1588235294117648) internal successors, (197), 173 states have internal predecessors, (197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:20:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-20 21:20:53,036 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 111 [2024-11-20 21:20:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:53,036 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-20 21:20:53,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 21:20:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-20 21:20:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 21:20:53,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:53,037 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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:20:53,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 21:20:53,038 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:53,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1815548285, now seen corresponding path program 1 times [2024-11-20 21:20:53,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:53,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601272251] [2024-11-20 21:20:53,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:53,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:53,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 21:20:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-20 21:20:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601272251] [2024-11-20 21:20:53,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601272251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:53,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:53,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 21:20:53,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429045354] [2024-11-20 21:20:53,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:53,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:20:53,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:53,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:20:53,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:20:53,549 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:53,630 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2024-11-20 21:20:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 21:20:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 111 [2024-11-20 21:20:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:53,632 INFO L225 Difference]: With dead ends: 184 [2024-11-20 21:20:53,632 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 21:20:53,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:20:53,633 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:53,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 277 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:20:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 21:20:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2024-11-20 21:20:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 174 states have internal predecessors, (198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:20:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2024-11-20 21:20:53,640 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 111 [2024-11-20 21:20:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:53,641 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2024-11-20 21:20:53,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2024-11-20 21:20:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 21:20:53,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:53,642 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:53,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 21:20:53,642 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:53,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 955738558, now seen corresponding path program 2 times [2024-11-20 21:20:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:53,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171015539] [2024-11-20 21:20:53,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-20 21:20:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171015539] [2024-11-20 21:20:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171015539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598289416] [2024-11-20 21:20:53,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:53,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:53,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:53,982 INFO L229 MonitoredProcess]: Starting monitored process 13 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:53,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-20 21:20:54,704 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 21:20:54,704 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:54,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:54,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-20 21:20:54,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598289416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-20 21:20:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135618104] [2024-11-20 21:20:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:54,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:54,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:54,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:54,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:54,805 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:54,850 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2024-11-20 21:20:54,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:54,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 112 [2024-11-20 21:20:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:54,852 INFO L225 Difference]: With dead ends: 179 [2024-11-20 21:20:54,852 INFO L226 Difference]: Without dead ends: 178 [2024-11-20 21:20:54,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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:54,853 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:54,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-20 21:20:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-20 21:20:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 171 states have (on average 1.152046783625731) internal successors, (197), 173 states have internal predecessors, (197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:20:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-20 21:20:54,861 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 112 [2024-11-20 21:20:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:54,862 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-20 21:20:54,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-20 21:20:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 21:20:54,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:54,863 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:54,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:55,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-20 21:20:55,064 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:55,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -436875678, now seen corresponding path program 1 times [2024-11-20 21:20:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:55,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832385155] [2024-11-20 21:20:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-20 21:20:55,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832385155] [2024-11-20 21:20:55,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832385155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876922075] [2024-11-20 21:20:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:55,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:55,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:55,411 INFO L229 MonitoredProcess]: Starting monitored process 14 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:55,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-20 21:20:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:56,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:56,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-20 21:20:56,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-20 21:20:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876922075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:56,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-20 21:20:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930656033] [2024-11-20 21:20:56,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:56,272 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:56,346 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2024-11-20 21:20:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:56,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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 113 [2024-11-20 21:20:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:56,348 INFO L225 Difference]: With dead ends: 284 [2024-11-20 21:20:56,348 INFO L226 Difference]: Without dead ends: 283 [2024-11-20 21:20:56,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 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:56,349 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:56,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:20:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-20 21:20:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-20 21:20:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 276 states have (on average 1.1159420289855073) internal successors, (308), 278 states have internal predecessors, (308), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:20:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 314 transitions. [2024-11-20 21:20:56,361 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 314 transitions. Word has length 113 [2024-11-20 21:20:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:56,362 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 314 transitions. [2024-11-20 21:20:56,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 314 transitions. [2024-11-20 21:20:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 21:20:56,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:56,363 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:56,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-20 21:20:56,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-20 21:20:56,564 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:56,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:56,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1482164134, now seen corresponding path program 1 times [2024-11-20 21:20:56,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:56,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123906794] [2024-11-20 21:20:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:56,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 21:20:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:56,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 21:20:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-20 21:20:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123906794] [2024-11-20 21:20:56,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123906794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047525368] [2024-11-20 21:20:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:56,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:56,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:56,907 INFO L229 MonitoredProcess]: Starting monitored process 15 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:56,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-20 21:20:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:57,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 21:20:57,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-20 21:20:57,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047525368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:57,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-20 21:20:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873597110] [2024-11-20 21:20:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:57,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:57,580 INFO L87 Difference]: Start difference. First operand 283 states and 314 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:57,604 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2024-11-20 21:20:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:57,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-20 21:20:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:57,607 INFO L225 Difference]: With dead ends: 283 [2024-11-20 21:20:57,607 INFO L226 Difference]: Without dead ends: 282 [2024-11-20 21:20:57,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:57,608 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 250 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:20:57,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 250 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-20 21:20:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-20 21:20:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.1123188405797102) internal successors, (307), 277 states have internal predecessors, (307), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:20:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 313 transitions. [2024-11-20 21:20:57,620 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 313 transitions. Word has length 127 [2024-11-20 21:20:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:57,621 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 313 transitions. [2024-11-20 21:20:57,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 313 transitions. [2024-11-20 21:20:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 21:20:57,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:57,622 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:57,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-20 21:20:57,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:57,823 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:57,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1297552444, now seen corresponding path program 1 times [2024-11-20 21:20:57,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:57,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085821327] [2024-11-20 21:20:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:57,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 21:20:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 21:20:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-20 21:20:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:58,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085821327] [2024-11-20 21:20:58,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085821327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:58,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:58,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:20:58,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535456185] [2024-11-20 21:20:58,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:58,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:58,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:58,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:58,149 INFO L87 Difference]: Start difference. First operand 282 states and 313 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:58,166 INFO L93 Difference]: Finished difference Result 322 states and 362 transitions. [2024-11-20 21:20:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 128 [2024-11-20 21:20:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:58,168 INFO L225 Difference]: With dead ends: 322 [2024-11-20 21:20:58,168 INFO L226 Difference]: Without dead ends: 283 [2024-11-20 21:20:58,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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,169 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:58,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-20 21:20:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-20 21:20:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 277 states have (on average 1.111913357400722) internal successors, (308), 278 states have internal predecessors, (308), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:20:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 314 transitions. [2024-11-20 21:20:58,182 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 314 transitions. Word has length 128 [2024-11-20 21:20:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 314 transitions. [2024-11-20 21:20:58,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:20:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 314 transitions. [2024-11-20 21:20:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 21:20:58,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:58,184 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:58,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 21:20:58,184 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:20:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1968055554, now seen corresponding path program 1 times [2024-11-20 21:20:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872875059] [2024-11-20 21:20:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 21:20:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 21:20:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-20 21:20:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872875059] [2024-11-20 21:20:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872875059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057275296] [2024-11-20 21:20:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:58,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:58,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:58,828 INFO L229 MonitoredProcess]: Starting monitored process 16 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,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-20 21:20:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:59,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 21:20:59,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-20 21:20:59,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-20 21:20:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057275296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:59,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-20 21:20:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393465007] [2024-11-20 21:20:59,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:59,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 21:20:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:59,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 21:20:59,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-20 21:20:59,946 INFO L87 Difference]: Start difference. First operand 283 states and 314 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 21:21:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:00,080 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2024-11-20 21:21:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 21:21:00,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 128 [2024-11-20 21:21:00,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:00,082 INFO L225 Difference]: With dead ends: 353 [2024-11-20 21:21:00,083 INFO L226 Difference]: Without dead ends: 283 [2024-11-20 21:21:00,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-20 21:21:00,084 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 71 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:00,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 566 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:21:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-20 21:21:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-20 21:21:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 277 states have (on average 1.108303249097473) internal successors, (307), 278 states have internal predecessors, (307), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:21:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2024-11-20 21:21:00,098 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 128 [2024-11-20 21:21:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:00,099 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2024-11-20 21:21:00,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 21:21:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2024-11-20 21:21:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 21:21:00,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:00,101 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:00,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-20 21:21:00,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 21:21:00,301 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash -222577589, now seen corresponding path program 2 times [2024-11-20 21:21:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:00,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989750202] [2024-11-20 21:21:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:21:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 21:21:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 21:21:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-20 21:21:02,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989750202] [2024-11-20 21:21:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989750202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860208608] [2024-11-20 21:21:02,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:02,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:02,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:02,469 INFO L229 MonitoredProcess]: Starting monitored process 17 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,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-20 21:21:03,268 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 21:21:03,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:03,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 21:21:03,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:03,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 21:21:03,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-20 21:21:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 327 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-20 21:21:03,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:03,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-20 21:21:03,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-20 21:21:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-20 21:21:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860208608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:03,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:21:03,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2024-11-20 21:21:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224293897] [2024-11-20 21:21:03,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 21:21:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 21:21:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:21:03,611 INFO L87 Difference]: Start difference. First operand 283 states and 313 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 21:21:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:03,782 INFO L93 Difference]: Finished difference Result 348 states and 399 transitions. [2024-11-20 21:21:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 21:21:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 163 [2024-11-20 21:21:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:03,783 INFO L225 Difference]: With dead ends: 348 [2024-11-20 21:21:03,784 INFO L226 Difference]: Without dead ends: 290 [2024-11-20 21:21:03,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-20 21:21:03,784 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:03,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 719 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:21:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-20 21:21:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2024-11-20 21:21:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 280 states have (on average 1.1035714285714286) internal successors, (309), 281 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:21:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2024-11-20 21:21:03,804 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 163 [2024-11-20 21:21:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:03,805 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2024-11-20 21:21:03,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 21:21:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2024-11-20 21:21:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 21:21:03,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:03,806 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:03,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-20 21:21:04,011 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:04,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1166437475, now seen corresponding path program 1 times [2024-11-20 21:21:04,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:04,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042457177] [2024-11-20 21:21:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:05,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:21:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:06,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 21:21:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:06,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 21:21:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-20 21:21:06,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:21:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042457177] [2024-11-20 21:21:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042457177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911216114] [2024-11-20 21:21:06,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:06,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:06,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:06,029 INFO L229 MonitoredProcess]: Starting monitored process 18 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:06,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-20 21:21:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:06,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 1994 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 21:21:06,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:06,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 21:21:06,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-20 21:21:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 327 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-20 21:21:07,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:07,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-20 21:21:07,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-20 21:21:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-20 21:21:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911216114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:07,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:21:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 16 [2024-11-20 21:21:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520456177] [2024-11-20 21:21:07,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 21:21:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:21:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 21:21:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:07,162 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 21:21:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:07,470 INFO L93 Difference]: Finished difference Result 355 states and 405 transitions. [2024-11-20 21:21:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:07,470 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 170 [2024-11-20 21:21:07,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:07,472 INFO L225 Difference]: With dead ends: 355 [2024-11-20 21:21:07,472 INFO L226 Difference]: Without dead ends: 308 [2024-11-20 21:21:07,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-20 21:21:07,473 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 42 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:07,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1142 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 21:21:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-20 21:21:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 290. [2024-11-20 21:21:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 284 states have (on average 1.1091549295774648) internal successors, (315), 285 states have internal predecessors, (315), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:21:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 321 transitions. [2024-11-20 21:21:07,495 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 321 transitions. Word has length 170 [2024-11-20 21:21:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:07,495 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 321 transitions. [2024-11-20 21:21:07,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-20 21:21:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 321 transitions. [2024-11-20 21:21:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 21:21:07,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:07,497 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:07,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-20 21:21:07,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:21:07,698 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:07,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1013270911, now seen corresponding path program 1 times [2024-11-20 21:21:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:21:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446812420] [2024-11-20 21:21:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:21:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 21:21:08,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 21:21:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 21:21:08,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 21:21:08,883 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 21:21:08,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-11-20 21:21:08,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-11-20 21:21:08,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-11-20 21:21:08,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-11-20 21:21:08,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-11-20 21:21:08,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-11-20 21:21:08,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-11-20 21:21:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-11-20 21:21:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-11-20 21:21:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-11-20 21:21:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-11-20 21:21:08,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-11-20 21:21:08,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-11-20 21:21:08,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-11-20 21:21:08,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-11-20 21:21:08,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-11-20 21:21:08,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-11-20 21:21:08,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-11-20 21:21:08,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-11-20 21:21:08,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-11-20 21:21:08,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-11-20 21:21:08,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-11-20 21:21:08,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-11-20 21:21:08,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-11-20 21:21:08,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-20 21:21:08,894 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 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:09,028 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 21:21:09,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:21:09 BoogieIcfgContainer [2024-11-20 21:21:09,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 21:21:09,033 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 21:21:09,033 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 21:21:09,033 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 21:21:09,033 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:37" (3/4) ... [2024-11-20 21:21:09,036 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 21:21:09,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 21:21:09,038 INFO L158 Benchmark]: Toolchain (without parser) took 33519.03ms. Allocated memory was 151.0MB in the beginning and 767.6MB in the end (delta: 616.6MB). Free memory was 92.9MB in the beginning and 279.7MB in the end (delta: -186.8MB). Peak memory consumption was 431.2MB. Max. memory is 16.1GB. [2024-11-20 21:21:09,040 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 21:21:09,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1004.91ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 92.5MB in the beginning and 157.3MB in the end (delta: -64.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2024-11-20 21:21:09,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.18ms. Allocated memory is still 211.8MB. Free memory was 157.3MB in the beginning and 149.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 21:21:09,040 INFO L158 Benchmark]: Boogie Preprocessor took 136.09ms. Allocated memory is still 211.8MB. Free memory was 149.9MB in the beginning and 140.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 21:21:09,040 INFO L158 Benchmark]: RCFGBuilder took 1183.89ms. Allocated memory is still 211.8MB. Free memory was 140.5MB in the beginning and 69.2MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-11-20 21:21:09,041 INFO L158 Benchmark]: TraceAbstraction took 31082.28ms. Allocated memory was 211.8MB in the beginning and 767.6MB in the end (delta: 555.7MB). Free memory was 68.1MB in the beginning and 280.7MB in the end (delta: -212.5MB). Peak memory consumption was 344.2MB. Max. memory is 16.1GB. [2024-11-20 21:21:09,041 INFO L158 Benchmark]: Witness Printer took 4.84ms. Allocated memory is still 767.6MB. Free memory was 280.7MB in the beginning and 279.7MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 21:21:09,042 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.16ms. Allocated memory is still 151.0MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1004.91ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 92.5MB in the beginning and 157.3MB in the end (delta: -64.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.18ms. Allocated memory is still 211.8MB. Free memory was 157.3MB in the beginning and 149.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.09ms. Allocated memory is still 211.8MB. Free memory was 149.9MB in the beginning and 140.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1183.89ms. Allocated memory is still 211.8MB. Free memory was 140.5MB in the beginning and 69.2MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31082.28ms. Allocated memory was 211.8MB in the beginning and 767.6MB in the end (delta: 555.7MB). Free memory was 68.1MB in the beginning and 280.7MB in the end (delta: -212.5MB). Peak memory consumption was 344.2MB. Max. memory is 16.1GB. * Witness Printer took 4.84ms. Allocated memory is still 767.6MB. Free memory was 280.7MB in the beginning and 279.7MB in the end (delta: 974.8kB). 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: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of strcmp at line 1383, overapproximation of strlen at line 1397, overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno = &bb_errno_location; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=10] [L1577] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=2, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1584] EXPR argc+1 [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] EXPR argc+1 [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 [L1587] int i=0; VAL [applet_name={-1:0}, argc=2, argv={-14:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0, mem_track={-15:0}, optind=1] [L1587] COND TRUE i= 2u) [L1395] argv = argv + 1l [L1396] EXPR \read(**argv) [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND TRUE !(s == ((const char *)((void *)0))) [L1484] EXPR \read(*s) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1484] COND FALSE !(!((signed int)*s == 0)) [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, c=47, dummy_utmp={11:0}, optind=1, s={-27:0}] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={-27:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={-27:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] m=strlen(s) [L1398] argv = argv + 1l [L1399] signed int tmp_statement_expression$6; [L1400] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1400] COND FALSE !(!(*argv == ((char *)((void *)0)))) [L1414] unsigned long int tmp_post$8 = m; [L1415] m = m + 1ul [L1416] s[(signed long int)tmp_post$8] = (char)10 [L1417] signed long int return_value_full_write$9; [L1418] CALL full_write(1, (const void *)s, m) [L1464] signed long int cc; [L1465] signed long int total = (signed long int)0; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775808U), optind=1, total=0] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=(((unsigned __int128) 1 << 64) | 9223372036854775808U), dummy_utmp={11:0}, fd=1, optind=1] [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=(((unsigned __int128) 1 << 64) | 9223372036854775808U), optind=1, ret=2] [L1571] return ret; VAL [\result=2, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=(((unsigned __int128) 1 << 64) | 9223372036854775808U), optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=(((unsigned __int128) 1 << 64) | 9223372036854775808U), dummy_utmp={11:0}, fd=1, n=2, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=(((unsigned __int128) 1 << 64) | 9223372036854775808U), dummy_utmp={11:0}, fd=1, n=2, optind=1] [L1510] return n; VAL [\result=2, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=(((unsigned __int128) 1 << 64) | 9223372036854775808U), dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, cc=2, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775808U), optind=1, total=0] [L1475] EXPR total + cc [L1475] total = total + cc [L1476] buf = (const void *)((const char *)buf + cc) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, cc=2, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775808U), optind=1, total=2] [L1466] len = len - (unsigned long int)cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775806), optind=1, total=2] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=(((unsigned __int128) 1 << 64) | 9223372036854775806), dummy_utmp={11:0}, fd=1, optind=1] [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=(((unsigned __int128) 1 << 64) | 9223372036854775806), optind=1, ret=9223372036854775806] [L1571] return ret; VAL [\result=9223372036854775806, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=(((unsigned __int128) 1 << 64) | 9223372036854775806), optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=(((unsigned __int128) 1 << 64) | 9223372036854775806), dummy_utmp={11:0}, fd=1, n=9223372036854775806, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=(((unsigned __int128) 1 << 64) | 9223372036854775806), dummy_utmp={11:0}, fd=1, n=9223372036854775806, optind=1] [L1510] return n; VAL [\result=9223372036854775806, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=(((unsigned __int128) 1 << 64) | 9223372036854775806), dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, cc=9223372036854775806, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775806), optind=1, total=2] [L1475] total + cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775806), optind=1] - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 31, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 774 mSDsluCounter, 10993 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7720 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1235 IncrementalHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 3273 mSDtfsCounter, 1235 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2516 GetRequests, 2363 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=30, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 44 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 3790 NumberOfCodeBlocks, 3636 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 4496 ConstructedInterpolants, 0 QuantifiedInterpolants, 10923 SizeOfPredicates, 22 NumberOfNonLiveVariables, 22745 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 57 InterpolantComputations, 20 PerfectInterpolantSequences, 12988/16442 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 21:21:09,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 21:21:11,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 21:21:11,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-20 21:21:11,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 21:21:11,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 21:21:11,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-20 21:21:11,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 21:21:11,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 21:21:11,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 21:21:11,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 21:21:11,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 21:21:11,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 21:21:11,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 21:21:11,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 21:21:11,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 21:21:11,555 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 21:21:11,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 21:21:11,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 21:21:11,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 21:21:11,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 21:21:11,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 21:21:11,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 21:21:11,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 21:21:11,560 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 21:21:11,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 21:21:11,560 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 21:21:11,560 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 21:21:11,561 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 21:21:11,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 21:21:11,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 21:21:11,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 21:21:11,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 21:21:11,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 21:21:11,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 21:21:11,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:21:11,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 21:21:11,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 21:21:11,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 21:21:11,567 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 21:21:11,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 21:21:11,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 21:21:11,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 21:21:11,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 21:21:11,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 21:21:11,569 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 -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2024-11-20 21:21:11,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 21:21:11,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 21:21:11,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 21:21:11,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 21:21:11,942 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 21:21:11,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-20 21:21:13,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 21:21:13,735 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 21:21:13,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-20 21:21:13,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d96abc47/55b294f0db2b4556850c2261fad051e2/FLAG2ad2e7435 [2024-11-20 21:21:13,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d96abc47/55b294f0db2b4556850c2261fad051e2 [2024-11-20 21:21:13,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 21:21:13,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 21:21:13,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 21:21:13,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 21:21:13,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 21:21:13,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:21:13" (1/1) ... [2024-11-20 21:21:13,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48720cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:13, skipping insertion in model container [2024-11-20 21:21:13,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:21:13" (1/1) ... [2024-11-20 21:21:13,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 21:21:14,502 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:14,528 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:14,532 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:14,540 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:14,544 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:14,555 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:14,556 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:14,557 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:14,559 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:14,561 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:14,578 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:14,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:21:14,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 21:21:14,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:21:14,849 INFO L204 MainTranslator]: Completed translation [2024-11-20 21:21:14,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:14 WrapperNode [2024-11-20 21:21:14,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 21:21:14,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 21:21:14,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 21:21:14,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 21:21:14,858 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:14" (1/1) ... [2024-11-20 21:21:14,907 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:14" (1/1) ... [2024-11-20 21:21:14,999 INFO L138 Inliner]: procedures = 353, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 734 [2024-11-20 21:21:15,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 21:21:15,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 21:21:15,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 21:21:15,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 21:21:15,013 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:14" (1/1) ... [2024-11-20 21:21:15,013 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:14" (1/1) ... [2024-11-20 21:21:15,029 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:14" (1/1) ... [2024-11-20 21:21:15,090 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 2, 3, 3, 355, 2, 12, 12]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 0, 3, 1, 355, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 2, 0, 1, 0, 1, 2, 5]. [2024-11-20 21:21:15,094 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:14" (1/1) ... [2024-11-20 21:21:15,095 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:14" (1/1) ... [2024-11-20 21:21:15,138 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:14" (1/1) ... [2024-11-20 21:21:15,151 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:14" (1/1) ... [2024-11-20 21:21:15,175 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:14" (1/1) ... [2024-11-20 21:21:15,183 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:14" (1/1) ... [2024-11-20 21:21:15,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 21:21:15,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 21:21:15,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 21:21:15,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 21:21:15,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:14" (1/1) ... [2024-11-20 21:21:15,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:21:15,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:15,240 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:15,246 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:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 21:21:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 21:21:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 21:21:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 21:21:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 21:21:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-20 21:21:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-20 21:21:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-20 21:21:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-20 21:21:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-20 21:21:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-20 21:21:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-20 21:21:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-20 21:21:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-20 21:21:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 21:21:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 21:21:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 21:21:15,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-20 21:21:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-20 21:21:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-20 21:21:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-20 21:21:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-20 21:21:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-20 21:21:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-20 21:21:15,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 21:21:15,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-20 21:21:15,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-20 21:21:15,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-20 21:21:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-20 21:21:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-20 21:21:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-20 21:21:15,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-20 21:21:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-20 21:21:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 21:21:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 21:21:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 21:21:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 21:21:15,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 21:21:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 21:21:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-20 21:21:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-20 21:21:15,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-20 21:21:15,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-20 21:21:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-20 21:21:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-20 21:21:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-20 21:21:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-20 21:21:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-20 21:21:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-20 21:21:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 21:21:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 21:21:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 21:21:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 21:21:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 21:21:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 21:21:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-20 21:21:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-20 21:21:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-20 21:21:15,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-20 21:21:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-20 21:21:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-20 21:21:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-20 21:21:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-20 21:21:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 21:21:15,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 21:21:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 21:21:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 21:21:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 21:21:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-20 21:21:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-20 21:21:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-20 21:21:15,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-20 21:21:15,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-20 21:21:15,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-20 21:21:15,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-20 21:21:15,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-20 21:21:15,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-20 21:21:15,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-20 21:21:15,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-20 21:21:15,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-20 21:21:15,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-20 21:21:15,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-20 21:21:15,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 21:21:15,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 21:21:15,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 21:21:15,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 21:21:16,831 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-20 21:21:16,831 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 21:21:16,851 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 21:21:16,851 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-20 21:21:16,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:16 BoogieIcfgContainer [2024-11-20 21:21:16,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 21:21:16,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 21:21:16,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 21:21:16,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 21:21:16,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:21:13" (1/3) ... [2024-11-20 21:21:16,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6922ca2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:21:16, skipping insertion in model container [2024-11-20 21:21:16,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:14" (2/3) ... [2024-11-20 21:21:16,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6922ca2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:21:16, skipping insertion in model container [2024-11-20 21:21:16,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:16" (3/3) ... [2024-11-20 21:21:16,864 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-20 21:21:16,898 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 21:21:16,898 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-20 21:21:16,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 21:21:16,977 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;@3e5c05b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 21:21:16,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-20 21:21:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 118 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 21:21:16,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:16,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 21:21:16,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:17,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-20 21:21:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500127317] [2024-11-20 21:21:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:17,021 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,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:17,024 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:17,046 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:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:17,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 21:21:17,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:17,507 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:17,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:17,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:17,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500127317] [2024-11-20 21:21:17,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500127317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:17,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:17,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 21:21:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169325762] [2024-11-20 21:21:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:17,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 21:21:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:17,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 21:21:17,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 21:21:17,541 INFO L87 Difference]: Start difference. First operand has 122 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 118 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:17,575 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2024-11-20 21:21:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 21:21:17,577 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:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:17,586 INFO L225 Difference]: With dead ends: 223 [2024-11-20 21:21:17,586 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 21:21:17,590 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:17,595 INFO L432 NwaCegarLoop]: 138 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, 138 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:17,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 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:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 21:21:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-20 21:21:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 89 states have (on average 1.449438202247191) internal successors, (129), 98 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2024-11-20 21:21:17,678 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 4 [2024-11-20 21:21:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:17,679 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2024-11-20 21:21:17,679 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:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2024-11-20 21:21:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 21:21:17,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:17,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 21:21:17,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 21:21:17,885 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:17,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:17,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-20 21:21:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:17,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146090563] [2024-11-20 21:21:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:17,889 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,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:17,892 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:17,894 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:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:18,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:18,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:18,253 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:18,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:18,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146090563] [2024-11-20 21:21:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146090563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:18,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660522493] [2024-11-20 21:21:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:18,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:18,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:18,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:18,257 INFO L87 Difference]: Start difference. First operand 102 states and 133 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:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:18,302 INFO L93 Difference]: Finished difference Result 202 states and 264 transitions. [2024-11-20 21:21:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:18,303 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:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:18,304 INFO L225 Difference]: With dead ends: 202 [2024-11-20 21:21:18,304 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 21:21:18,305 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:18,305 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 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:18,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 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:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 21:21:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-20 21:21:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.434782608695652) internal successors, (132), 101 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-20 21:21:18,316 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 5 [2024-11-20 21:21:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:18,316 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-20 21:21:18,316 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:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-20 21:21:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 21:21:18,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:18,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-20 21:21:18,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:18,518 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:18,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:18,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-20 21:21:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517196966] [2024-11-20 21:21:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:18,527 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:18,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:18,531 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:18,534 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:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:18,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:18,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:18,908 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:18,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:18,956 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:18,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517196966] [2024-11-20 21:21:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517196966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:18,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:18,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-20 21:21:18,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729204132] [2024-11-20 21:21:18,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:18,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:18,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:18,958 INFO L87 Difference]: Start difference. First operand 105 states and 136 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:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:19,073 INFO L93 Difference]: Finished difference Result 205 states and 269 transitions. [2024-11-20 21:21:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:19,077 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:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:19,078 INFO L225 Difference]: With dead ends: 205 [2024-11-20 21:21:19,079 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 21:21:19,079 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:19,080 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:19,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 506 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:21:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 21:21:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-20 21:21:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 101 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-20 21:21:19,094 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 8 [2024-11-20 21:21:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:19,097 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-20 21:21:19,097 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:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-20 21:21:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 21:21:19,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:19,098 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:19,111 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:19,298 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:19,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash 765480000, now seen corresponding path program 1 times [2024-11-20 21:21:19,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:19,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124458667] [2024-11-20 21:21:19,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:19,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:19,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:19,304 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:19,307 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:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:19,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:19,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:19,666 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:19,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:19,740 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:19,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:19,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124458667] [2024-11-20 21:21:19,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124458667] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:19,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:19,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 21:21:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833909753] [2024-11-20 21:21:19,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:19,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:21:19,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:21:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:21:19,744 INFO L87 Difference]: Start difference. First operand 105 states and 136 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:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:19,916 INFO L93 Difference]: Finished difference Result 213 states and 278 transitions. [2024-11-20 21:21:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:21:19,918 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:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:19,919 INFO L225 Difference]: With dead ends: 213 [2024-11-20 21:21:19,919 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 21:21:19,920 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:19,921 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 10 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 507 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:19,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 507 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:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 21:21:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-20 21:21:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 113 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-11-20 21:21:19,939 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 17 [2024-11-20 21:21:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:19,939 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-11-20 21:21:19,939 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:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-11-20 21:21:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 21:21:19,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:19,940 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:19,954 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:20,140 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:20,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:20,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash -871046720, now seen corresponding path program 2 times [2024-11-20 21:21:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:20,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86149510] [2024-11-20 21:21:20,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:20,142 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:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:20,145 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:20,147 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:20,426 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:20,426 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:20,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:20,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:20,475 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:20,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:20,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:20,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86149510] [2024-11-20 21:21:20,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86149510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 21:21:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588354361] [2024-11-20 21:21:20,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:20,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:21:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:20,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:21:20,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:21:20,477 INFO L87 Difference]: Start difference. First operand 117 states and 148 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:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:20,954 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2024-11-20 21:21:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:21:20,955 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:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:20,957 INFO L225 Difference]: With dead ends: 117 [2024-11-20 21:21:20,957 INFO L226 Difference]: Without dead ends: 115 [2024-11-20 21:21:20,958 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:20,958 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 115 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:20,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 359 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 21:21:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-20 21:21:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-20 21:21:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 111 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2024-11-20 21:21:20,970 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 29 [2024-11-20 21:21:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:20,971 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2024-11-20 21:21:20,971 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:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2024-11-20 21:21:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 21:21:20,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:20,973 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:20,983 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:21,173 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:21,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:21,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:21,174 INFO L85 PathProgramCache]: Analyzing trace with hash -456152404, now seen corresponding path program 1 times [2024-11-20 21:21:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198972821] [2024-11-20 21:21:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:21,175 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,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:21,176 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:21,178 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:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:21,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:21:21,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:21,701 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:21,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:21,916 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:21,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:21,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198972821] [2024-11-20 21:21:21,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198972821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:21,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:21,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 21:21:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71517421] [2024-11-20 21:21:21,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:21,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 21:21:21,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:21,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 21:21:21,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:21,918 INFO L87 Difference]: Start difference. First operand 115 states and 146 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:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:22,300 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2024-11-20 21:21:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:22,302 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:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:22,303 INFO L225 Difference]: With dead ends: 221 [2024-11-20 21:21:22,303 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 21:21:22,304 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:22,305 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 8 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:22,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1119 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 21:21:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 21:21:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-20 21:21:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 123 states have internal predecessors, (154), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2024-11-20 21:21:22,338 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 35 [2024-11-20 21:21:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:22,338 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2024-11-20 21:21:22,339 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:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2024-11-20 21:21:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 21:21:22,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:22,340 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:22,357 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:22,545 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:22,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:22,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:22,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1314512940, now seen corresponding path program 2 times [2024-11-20 21:21:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992313988] [2024-11-20 21:21:22,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:22,548 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:22,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:22,551 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:22,552 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:22,908 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:22,908 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:22,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:22,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:22,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:22,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:22,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:22,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992313988] [2024-11-20 21:21:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992313988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:22,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:22,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:22,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25539870] [2024-11-20 21:21:22,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:22,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:22,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:22,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:22,945 INFO L87 Difference]: Start difference. First operand 127 states and 158 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:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:22,997 INFO L93 Difference]: Finished difference Result 218 states and 280 transitions. [2024-11-20 21:21:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:22,997 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:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:22,998 INFO L225 Difference]: With dead ends: 218 [2024-11-20 21:21:22,998 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 21:21:22,999 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:23,000 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 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:23,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 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:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 21:21:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-20 21:21:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 126 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2024-11-20 21:21:23,009 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 47 [2024-11-20 21:21:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:23,009 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2024-11-20 21:21:23,009 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:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2024-11-20 21:21:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:21:23,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:23,011 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:23,025 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:23,211 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:23,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:23,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash -856727864, now seen corresponding path program 1 times [2024-11-20 21:21:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073467883] [2024-11-20 21:21:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:23,214 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:23,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:23,215 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:23,216 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:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:23,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:23,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:23,657 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:23,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:23,711 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:23,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:23,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073467883] [2024-11-20 21:21:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073467883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:23,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:23,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-20 21:21:23,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036066732] [2024-11-20 21:21:23,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:23,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:23,713 INFO L87 Difference]: Start difference. First operand 130 states and 161 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:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:23,848 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2024-11-20 21:21:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:23,850 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:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:23,851 INFO L225 Difference]: With dead ends: 224 [2024-11-20 21:21:23,851 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 21:21:23,851 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:23,852 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 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:23,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 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:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 21:21:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-20 21:21:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 126 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2024-11-20 21:21:23,861 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 50 [2024-11-20 21:21:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2024-11-20 21:21:23,861 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:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2024-11-20 21:21:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-20 21:21:23,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:23,863 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] [2024-11-20 21:21:23,879 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:24,063 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:24,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2047188748, now seen corresponding path program 1 times [2024-11-20 21:21:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266227784] [2024-11-20 21:21:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:24,065 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:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:24,066 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:24,067 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:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:24,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:24,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:24,434 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:24,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:24,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266227784] [2024-11-20 21:21:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266227784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:24,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:24,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61861058] [2024-11-20 21:21:24,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:24,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:24,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:24,436 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:24,463 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2024-11-20 21:21:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:24,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 51 [2024-11-20 21:21:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:24,465 INFO L225 Difference]: With dead ends: 134 [2024-11-20 21:21:24,465 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 21:21:24,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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:24,466 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:24,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:21:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 21:21:24,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-20 21:21:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 129 states have internal predecessors, (160), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2024-11-20 21:21:24,473 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 51 [2024-11-20 21:21:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:24,473 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2024-11-20 21:21:24,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2024-11-20 21:21:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-20 21:21:24,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:24,475 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] [2024-11-20 21:21:24,492 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 (10)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:24,675 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:24,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:24,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1371935090, now seen corresponding path program 1 times [2024-11-20 21:21:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:24,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725861089] [2024-11-20 21:21:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:24,677 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:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:24,679 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:24,680 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:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:25,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:21:25,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:25,152 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:25,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:25,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725861089] [2024-11-20 21:21:25,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725861089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:25,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:25,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:21:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447800434] [2024-11-20 21:21:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:25,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:25,157 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:25,758 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2024-11-20 21:21:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 52 [2024-11-20 21:21:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:25,760 INFO L225 Difference]: With dead ends: 135 [2024-11-20 21:21:25,760 INFO L226 Difference]: Without dead ends: 134 [2024-11-20 21:21:25,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:21:25,761 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 138 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:25,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 423 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 21:21:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-20 21:21:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2024-11-20 21:21:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 124 states have (on average 1.282258064516129) internal successors, (159), 128 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2024-11-20 21:21:25,769 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 52 [2024-11-20 21:21:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:25,769 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2024-11-20 21:21:25,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2024-11-20 21:21:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 21:21:25,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:25,771 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, 1, 1, 1, 1] [2024-11-20 21:21:25,787 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:25,971 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:25,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:25,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash -735253954, now seen corresponding path program 1 times [2024-11-20 21:21:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:25,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484341277] [2024-11-20 21:21:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:25,974 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:25,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:25,975 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:25,976 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:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:26,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:26,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:26,376 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:26,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:26,421 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:26,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:26,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484341277] [2024-11-20 21:21:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484341277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:26,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:26,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-20 21:21:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076436205] [2024-11-20 21:21:26,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:26,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:26,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:26,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:26,423 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:26,504 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2024-11-20 21:21:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:26,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 54 [2024-11-20 21:21:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:26,507 INFO L225 Difference]: With dead ends: 139 [2024-11-20 21:21:26,507 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 21:21:26,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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:26,508 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:26,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:21:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 21:21:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-20 21:21:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 114 states have (on average 1.263157894736842) internal successors, (144), 117 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2024-11-20 21:21:26,515 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 54 [2024-11-20 21:21:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:26,516 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2024-11-20 21:21:26,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2024-11-20 21:21:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 21:21:26,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:26,521 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] [2024-11-20 21:21:26,536 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:26,721 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:26,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:26,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash -180848171, now seen corresponding path program 1 times [2024-11-20 21:21:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:26,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530965000] [2024-11-20 21:21:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:26,723 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:26,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:26,724 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:26,725 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:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:27,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:27,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-20 21:21:27,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-20 21:21:27,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530965000] [2024-11-20 21:21:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530965000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:27,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:27,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 21:21:27,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921598324] [2024-11-20 21:21:27,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:27,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:21:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:27,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:21:27,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:21:27,237 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:27,519 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2024-11-20 21:21:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:21:27,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 54 [2024-11-20 21:21:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:27,521 INFO L225 Difference]: With dead ends: 215 [2024-11-20 21:21:27,521 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 21:21:27,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 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:27,522 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 8 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 440 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:27,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 440 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:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 21:21:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-20 21:21:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 129 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2024-11-20 21:21:27,529 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 160 transitions. Word has length 54 [2024-11-20 21:21:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:27,529 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 160 transitions. [2024-11-20 21:21:27,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2024-11-20 21:21:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-20 21:21:27,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:27,534 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] [2024-11-20 21:21:27,549 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:27,735 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:27,735 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash -614640115, now seen corresponding path program 1 times [2024-11-20 21:21:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053657696] [2024-11-20 21:21:27,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:27,736 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:27,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:27,738 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:27,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 21:21:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:28,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:28,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:28,087 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:28,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:28,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:28,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053657696] [2024-11-20 21:21:28,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053657696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:28,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:28,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:21:28,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483608443] [2024-11-20 21:21:28,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:28,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:28,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:28,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:28,089 INFO L87 Difference]: Start difference. First operand 133 states and 160 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:28,100 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2024-11-20 21:21:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 55 [2024-11-20 21:21:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:28,101 INFO L225 Difference]: With dead ends: 182 [2024-11-20 21:21:28,101 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 21:21:28,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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:28,104 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:28,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:21:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 21:21:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-20 21:21:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 113 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2024-11-20 21:21:28,114 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 55 [2024-11-20 21:21:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:28,115 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2024-11-20 21:21:28,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2024-11-20 21:21:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 21:21:28,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:28,116 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] [2024-11-20 21:21:28,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-20 21:21:28,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:28,317 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:28,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash 692610261, now seen corresponding path program 2 times [2024-11-20 21:21:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243515169] [2024-11-20 21:21:28,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:28,319 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:28,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:28,320 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:28,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 21:21:28,642 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:28,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:28,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:28,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-20 21:21:28,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:28,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:28,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243515169] [2024-11-20 21:21:28,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243515169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:28,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:28,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:28,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203803415] [2024-11-20 21:21:28,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:28,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:28,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:28,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:28,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:28,711 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:29,018 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2024-11-20 21:21:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:29,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:29,020 INFO L225 Difference]: With dead ends: 141 [2024-11-20 21:21:29,021 INFO L226 Difference]: Without dead ends: 140 [2024-11-20 21:21:29,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:29,023 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:29,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 21:21:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-20 21:21:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-20 21:21:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 134 states have (on average 1.1865671641791045) internal successors, (159), 136 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2024-11-20 21:21:29,037 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 66 [2024-11-20 21:21:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:29,037 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2024-11-20 21:21:29,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2024-11-20 21:21:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 21:21:29,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:29,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:29,052 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 (15)] Ended with exit code 0 [2024-11-20 21:21:29,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:29,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:29,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash -773011160, now seen corresponding path program 1 times [2024-11-20 21:21:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:29,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912730167] [2024-11-20 21:21:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:29,240 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:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:29,241 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:29,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 21:21:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:29,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:21:29,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-20 21:21:29,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:29,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:29,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912730167] [2024-11-20 21:21:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912730167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 21:21:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103075912] [2024-11-20 21:21:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:29,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:29,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:29,754 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:30,182 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2024-11-20 21:21:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:30,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 75 [2024-11-20 21:21:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:30,184 INFO L225 Difference]: With dead ends: 194 [2024-11-20 21:21:30,184 INFO L226 Difference]: Without dead ends: 140 [2024-11-20 21:21:30,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 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:30,185 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 91 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:30,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 314 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 21:21:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-20 21:21:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-20 21:21:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 136 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2024-11-20 21:21:30,203 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 75 [2024-11-20 21:21:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:30,204 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2024-11-20 21:21:30,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2024-11-20 21:21:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 21:21:30,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:30,205 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:30,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:30,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:30,406 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:30,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:30,406 INFO L85 PathProgramCache]: Analyzing trace with hash -475670046, now seen corresponding path program 1 times [2024-11-20 21:21:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:30,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904764741] [2024-11-20 21:21:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:30,407 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:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:30,408 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:30,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-20 21:21:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:30,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:21:30,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-20 21:21:31,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-20 21:21:31,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:31,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904764741] [2024-11-20 21:21:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904764741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:31,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:31,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 21:21:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37393293] [2024-11-20 21:21:31,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:31,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 21:21:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 21:21:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:31,266 INFO L87 Difference]: Start difference. First operand 140 states and 162 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:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:32,196 INFO L93 Difference]: Finished difference Result 245 states and 294 transitions. [2024-11-20 21:21:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:32,197 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 89 [2024-11-20 21:21:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:32,198 INFO L225 Difference]: With dead ends: 245 [2024-11-20 21:21:32,198 INFO L226 Difference]: Without dead ends: 164 [2024-11-20 21:21:32,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 162 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:32,199 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:32,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1048 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 21:21:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-20 21:21:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-20 21:21:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 158 states have (on average 1.1518987341772151) internal successors, (182), 160 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2024-11-20 21:21:32,208 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 89 [2024-11-20 21:21:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:32,208 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2024-11-20 21:21:32,208 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:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2024-11-20 21:21:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 21:21:32,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:32,210 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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:32,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:32,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:32,410 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:32,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1799807557, now seen corresponding path program 1 times [2024-11-20 21:21:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590281366] [2024-11-20 21:21:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:32,412 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:32,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:32,413 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:32,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 21:21:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:33,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 21:21:33,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-20 21:21:33,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-11-20 21:21:33,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:33,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590281366] [2024-11-20 21:21:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590281366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:33,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:33,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2024-11-20 21:21:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942630184] [2024-11-20 21:21:33,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:33,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 21:21:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 21:21:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:21:33,880 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 21:21:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:35,086 INFO L93 Difference]: Finished difference Result 256 states and 297 transitions. [2024-11-20 21:21:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:35,088 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2024-11-20 21:21:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:35,089 INFO L225 Difference]: With dead ends: 256 [2024-11-20 21:21:35,089 INFO L226 Difference]: Without dead ends: 199 [2024-11-20 21:21:35,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-20 21:21:35,090 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 162 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:35,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 524 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 21:21:35,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-20 21:21:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-20 21:21:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 193 states have (on average 1.1295336787564767) internal successors, (218), 195 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2024-11-20 21:21:35,101 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 110 [2024-11-20 21:21:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:35,102 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2024-11-20 21:21:35,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-20 21:21:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2024-11-20 21:21:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 21:21:35,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:35,104 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:35,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-20 21:21:35,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:35,304 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:35,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash -46553016, now seen corresponding path program 2 times [2024-11-20 21:21:35,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:35,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195169329] [2024-11-20 21:21:35,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:35,306 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:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:35,310 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:35,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 21:21:35,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:35,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:35,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:35,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-20 21:21:35,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:35,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195169329] [2024-11-20 21:21:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195169329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:35,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:35,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:21:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526698294] [2024-11-20 21:21:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:35,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:21:35,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:21:35,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:21:35,774 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 21:21:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:35,839 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2024-11-20 21:21:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:21:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 145 [2024-11-20 21:21:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:35,841 INFO L225 Difference]: With dead ends: 226 [2024-11-20 21:21:35,841 INFO L226 Difference]: Without dead ends: 204 [2024-11-20 21:21:35,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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:35,842 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:35,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 372 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:21:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-20 21:21:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2024-11-20 21:21:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2024-11-20 21:21:35,855 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 145 [2024-11-20 21:21:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:35,873 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2024-11-20 21:21:35,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 21:21:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2024-11-20 21:21:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 21:21:35,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:35,874 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:35,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:36,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:36,075 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:36,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash 10705286, now seen corresponding path program 1 times [2024-11-20 21:21:36,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630830198] [2024-11-20 21:21:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:36,077 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:36,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:36,078 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:36,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-20 21:21:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:37,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:37,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-20 21:21:37,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:37,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:37,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630830198] [2024-11-20 21:21:37,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630830198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:37,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:37,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:21:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954439425] [2024-11-20 21:21:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:37,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:37,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:37,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:37,171 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:37,196 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2024-11-20 21:21:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:37,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 145 [2024-11-20 21:21:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:37,198 INFO L225 Difference]: With dead ends: 228 [2024-11-20 21:21:37,198 INFO L226 Difference]: Without dead ends: 201 [2024-11-20 21:21:37,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 143 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:37,199 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:37,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:21:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-20 21:21:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-20 21:21:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 195 states have (on average 1.1282051282051282) internal successors, (220), 197 states have internal predecessors, (220), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2024-11-20 21:21:37,213 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 145 [2024-11-20 21:21:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:37,213 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2024-11-20 21:21:37,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2024-11-20 21:21:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 21:21:37,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:37,215 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:37,253 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 (20)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:37,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:37,416 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 828353736, now seen corresponding path program 1 times [2024-11-20 21:21:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031004464] [2024-11-20 21:21:37,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:37,417 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:37,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:37,419 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 21:21:37,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-20 21:21:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:38,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 21:21:38,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-20 21:21:38,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:38,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:38,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031004464] [2024-11-20 21:21:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031004464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:38,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:38,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:21:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858565566] [2024-11-20 21:21:38,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:38,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:38,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:38,566 INFO L87 Difference]: Start difference. First operand 201 states and 224 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:38,656 INFO L93 Difference]: Finished difference Result 220 states and 247 transitions. [2024-11-20 21:21:38,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:38,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 145 [2024-11-20 21:21:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:38,659 INFO L225 Difference]: With dead ends: 220 [2024-11-20 21:21:38,659 INFO L226 Difference]: Without dead ends: 218 [2024-11-20 21:21:38,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:38,660 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:38,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 367 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:21:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-20 21:21:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2024-11-20 21:21:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.1304347826086956) internal successors, (234), 209 states have internal predecessors, (234), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:21:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 240 transitions. [2024-11-20 21:21:38,672 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 240 transitions. Word has length 145 [2024-11-20 21:21:38,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:38,673 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 240 transitions. [2024-11-20 21:21:38,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 21:21:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 240 transitions. [2024-11-20 21:21:38,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-20 21:21:38,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:38,674 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 10, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:38,706 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 (21)] Ended with exit code 0 [2024-11-20 21:21:38,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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,875 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:38,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash -328131403, now seen corresponding path program 2 times [2024-11-20 21:21:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077025885] [2024-11-20 21:21:38,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:38,876 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:38,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:38,878 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38,878 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 (22)] Waiting until timeout for monitored process [2024-11-20 21:21:39,384 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:39,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:39,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 21:21:39,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2024-11-20 21:21:39,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2024-11-20 21:21:39,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077025885] [2024-11-20 21:21:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077025885] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:39,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:21:39,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 21:21:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252583987] [2024-11-20 21:21:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:39,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:39,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:21:39,833 INFO L87 Difference]: Start difference. First operand 214 states and 240 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:39,936 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2024-11-20 21:21:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 148 [2024-11-20 21:21:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:39,938 INFO L225 Difference]: With dead ends: 214 [2024-11-20 21:21:39,938 INFO L226 Difference]: Without dead ends: 213 [2024-11-20 21:21:39,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:21:39,939 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:39,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:21:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-20 21:21:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 179. [2024-11-20 21:21:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 173 states have (on average 1.1445086705202312) internal successors, (198), 174 states have internal predecessors, (198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:21:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2024-11-20 21:21:39,950 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 148 [2024-11-20 21:21:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:39,951 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2024-11-20 21:21:39,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2024-11-20 21:21:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 21:21:39,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:39,952 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:39,966 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 (22)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:40,153 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:40,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash 269914731, now seen corresponding path program 1 times [2024-11-20 21:21:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566902204] [2024-11-20 21:21:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:40,155 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:40,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:40,156 INFO L229 MonitoredProcess]: Starting monitored process 23 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:40,157 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 (23)] Waiting until timeout for monitored process [2024-11-20 21:21:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:41,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 21:21:41,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-11-20 21:21:41,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-20 21:21:41,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566902204] [2024-11-20 21:21:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566902204] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:41,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:21:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-20 21:21:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334084485] [2024-11-20 21:21:41,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:41,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:21:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:21:41,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:21:41,678 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 21:21:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:41,867 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2024-11-20 21:21:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:21:41,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 162 [2024-11-20 21:21:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:41,870 INFO L225 Difference]: With dead ends: 187 [2024-11-20 21:21:41,870 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 21:21:41,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:41,871 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 16 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:41,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 349 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 21:21:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 21:21:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2024-11-20 21:21:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.138728323699422) internal successors, (197), 173 states have internal predecessors, (197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 21:21:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-20 21:21:41,882 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 162 [2024-11-20 21:21:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:41,883 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-20 21:21:41,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 21:21:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-20 21:21:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 21:21:41,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:41,885 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:41,923 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 (23)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:42,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:42,085 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-20 21:21:42,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -222577589, now seen corresponding path program 1 times [2024-11-20 21:21:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069412489] [2024-11-20 21:21:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:42,087 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:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:42,088 INFO L229 MonitoredProcess]: Starting monitored process 24 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:42,089 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 (24)] Waiting until timeout for monitored process [2024-11-20 21:21:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:43,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 21:21:43,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:43,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-20 21:21:43,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 21:21:43,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 21:21:43,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-11-20 21:21:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 327 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-20 21:21:43,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:44,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-20 21:21:44,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-20 21:21:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-20 21:21:44,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:44,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069412489] [2024-11-20 21:21:44,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069412489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:44,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:44,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2024-11-20 21:21:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836590764] [2024-11-20 21:21:44,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:44,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 21:21:44,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:44,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 21:21:44,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:21:44,286 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)