./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/dirname-1.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 deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:50:22,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:50:22,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-10 21:50:23,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:50:23,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:50:23,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:50:23,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:50:23,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:50:23,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:50:23,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:50:23,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:50:23,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:50:23,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:50:23,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:50:23,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:50:23,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:50:23,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:50:23,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:50:23,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:50:23,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:50:23,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:50:23,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:50:23,044 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:50:23,045 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:50:23,045 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:50:23,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:50:23,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:50:23,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:50:23,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:50:23,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:50:23,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:50:23,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:50:23,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:50:23,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:50:23,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:50:23,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:50:23,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:50:23,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:50:23,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:50:23,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:50:23,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:50:23,050 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 -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2024-11-10 21:50:23,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:50:23,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:50:23,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:50:23,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:50:23,297 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:50:23,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-10 21:50:24,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:50:24,981 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:50:24,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-10 21:50:25,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c539bfc/867a0fca01f24a929b20c648bcdfc85c/FLAG0fd08473d [2024-11-10 21:50:25,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0c539bfc/867a0fca01f24a929b20c648bcdfc85c [2024-11-10 21:50:25,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:50:25,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:50:25,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:50:25,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:50:25,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:50:25,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459e53c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25, skipping insertion in model container [2024-11-10 21:50:25,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:50:25,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:50:25,664 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:50:25,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:50:25,797 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:50:25,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25 WrapperNode [2024-11-10 21:50:25,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:50:25,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:50:25,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:50:25,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:50:25,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,873 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 664 [2024-11-10 21:50:25,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:50:25,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:50:25,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:50:25,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:50:25,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,913 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 11, 6, 3, 3, 2, 3, 4, 4, 4, 4, 3, 2, 44, 355]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 0, 0, 3, 3, 0, 3, 3, 3, 3, 3, 3, 0, 42, 355]. The 9 writes are split as follows [0, 2, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 1, 2, 0]. [2024-11-10 21:50:25,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:50:25,947 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:50:25,947 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:50:25,947 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:50:25,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (1/1) ... [2024-11-10 21:50:25,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:50:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:25,991 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-10 21:50:26,000 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-10 21:50:26,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 21:50:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 21:50:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 21:50:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 21:50:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 21:50:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-10 21:50:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-10 21:50:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-10 21:50:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-10 21:50:26,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-10 21:50:26,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-10 21:50:26,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-10 21:50:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-10 21:50:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-10 21:50:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-10 21:50:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-10 21:50:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 21:50:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 21:50:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 21:50:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-10 21:50:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-10 21:50:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-10 21:50:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-10 21:50:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-10 21:50:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-10 21:50:26,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-10 21:50:26,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 21:50:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:50:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 21:50:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 21:50:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 21:50:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-10 21:50:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-10 21:50:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-10 21:50:26,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-10 21:50:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-10 21:50:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-10 21:50:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-10 21:50:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-10 21:50:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-10 21:50:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-10 21:50:26,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-10 21:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-10 21:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 21:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 21:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 21:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 21:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 21:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 21:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 21:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 21:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-10 21:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-10 21:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-10 21:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-10 21:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-10 21:50:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-10 21:50:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-10 21:50:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:50:26,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:50:26,259 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:50:26,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:50:26,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2024-11-10 21:50:26,792 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-10 21:50:26,793 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:50:26,805 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:50:26,806 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 21:50:26,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:50:26 BoogieIcfgContainer [2024-11-10 21:50:26,807 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:50:26,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:50:26,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:50:26,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:50:26,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:50:25" (1/3) ... [2024-11-10 21:50:26,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd8b4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:50:26, skipping insertion in model container [2024-11-10 21:50:26,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:25" (2/3) ... [2024-11-10 21:50:26,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd8b4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:50:26, skipping insertion in model container [2024-11-10 21:50:26,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:50:26" (3/3) ... [2024-11-10 21:50:26,813 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2024-11-10 21:50:26,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:50:26,826 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-10 21:50:26,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:50:26,870 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;@66b06d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:50:26,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-10 21:50:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 111 states have internal predecessors, (136), 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-10 21:50:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 21:50:26,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:26,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 21:50:26,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:26,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 173650705, now seen corresponding path program 1 times [2024-11-10 21:50:26,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653474981] [2024-11-10 21:50:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:27,255 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-10 21:50:27,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:27,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653474981] [2024-11-10 21:50:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653474981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277123866] [2024-11-10 21:50:27,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:27,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:27,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:27,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:27,285 INFO L87 Difference]: Start difference. First operand has 114 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 111 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 3 states, 2 states have (on average 2.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-10 21:50:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:27,325 INFO L93 Difference]: Finished difference Result 211 states and 259 transitions. [2024-11-10 21:50:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:27,327 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-10 21:50:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:27,333 INFO L225 Difference]: With dead ends: 211 [2024-11-10 21:50:27,333 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 21:50:27,335 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-10 21:50:27,337 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:27,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 213 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 21:50:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-10 21:50:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 100 states have internal predecessors, (115), 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-10 21:50:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2024-11-10 21:50:27,368 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 5 [2024-11-10 21:50:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:27,368 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2024-11-10 21:50:27,369 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-10 21:50:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2024-11-10 21:50:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 21:50:27,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:27,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:27,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 21:50:27,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:27,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:27,370 INFO L85 PathProgramCache]: Analyzing trace with hash 470847170, now seen corresponding path program 1 times [2024-11-10 21:50:27,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:27,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307031832] [2024-11-10 21:50:27,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:27,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:27,533 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-10 21:50:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:27,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307031832] [2024-11-10 21:50:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307031832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416078687] [2024-11-10 21:50:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:27,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:27,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:27,538 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-10 21:50:27,539 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-10 21:50:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:27,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:27,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:27,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416078687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:27,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:50:27,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-10 21:50:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106337708] [2024-11-10 21:50:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:27,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:50:27,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:50:27,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:50:27,835 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-10 21:50:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:27,860 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-10 21:50:27,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:50:27,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-10 21:50:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:27,861 INFO L225 Difference]: With dead ends: 104 [2024-11-10 21:50:27,861 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 21:50:27,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-10 21:50:27,862 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:27,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 211 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 21:50:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-10 21:50:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 99 states have internal predecessors, (114), 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-10 21:50:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2024-11-10 21:50:27,870 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 10 [2024-11-10 21:50:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:27,870 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2024-11-10 21:50:27,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-10 21:50:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2024-11-10 21:50:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 21:50:27,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:27,872 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 21:50:27,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 21:50:28,075 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-10 21:50:28,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:28,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1711360493, now seen corresponding path program 1 times [2024-11-10 21:50:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403396116] [2024-11-10 21:50:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 21:50:28,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:28,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403396116] [2024-11-10 21:50:28,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403396116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:28,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:28,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:28,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002449523] [2024-11-10 21:50:28,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:28,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:28,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:28,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:28,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:28,153 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10 21:50:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:28,166 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2024-11-10 21:50:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:28,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-10 21:50:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:28,167 INFO L225 Difference]: With dead ends: 102 [2024-11-10 21:50:28,167 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 21:50:28,167 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-10 21:50:28,168 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 211 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-10 21:50:28,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 21:50:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-10 21:50:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 96 states have internal predecessors, (111), 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-10 21:50:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2024-11-10 21:50:28,174 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 11 [2024-11-10 21:50:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:28,174 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2024-11-10 21:50:28,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-10 21:50:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2024-11-10 21:50:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 21:50:28,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:28,175 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:28,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:50:28,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:28,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash -905149225, now seen corresponding path program 1 times [2024-11-10 21:50:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:28,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191521568] [2024-11-10 21:50:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:28,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 21:50:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:28,301 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-10 21:50:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:28,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191521568] [2024-11-10 21:50:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191521568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039857564] [2024-11-10 21:50:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:28,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:28,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:28,308 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-10 21:50:28,315 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-10 21:50:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:28,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:50:28,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 21:50:28,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039857564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:28,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:50:28,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-10 21:50:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000233084] [2024-11-10 21:50:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:28,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:28,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:28,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:28,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:50:28,549 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-10 21:50:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:28,570 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2024-11-10 21:50:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:28,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2024-11-10 21:50:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:28,571 INFO L225 Difference]: With dead ends: 99 [2024-11-10 21:50:28,571 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 21:50:28,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-10 21:50:28,572 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 109 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-10 21:50:28,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 109 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 21:50:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 21:50:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 94 states have internal predecessors, (109), 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-10 21:50:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2024-11-10 21:50:28,578 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 16 [2024-11-10 21:50:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:28,578 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2024-11-10 21:50:28,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-10 21:50:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2024-11-10 21:50:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 21:50:28,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:28,579 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:28,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 21:50:28,780 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-10 21:50:28,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:28,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2005145201, now seen corresponding path program 1 times [2024-11-10 21:50:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123759147] [2024-11-10 21:50:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 21:50:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:28,960 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-10 21:50:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123759147] [2024-11-10 21:50:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123759147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497100044] [2024-11-10 21:50:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:28,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:28,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:28,963 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-10 21:50:28,965 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-10 21:50:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:29,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:29,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:29,181 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-10 21:50:29,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:29,211 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-10 21:50:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497100044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:29,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 21:50:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547375081] [2024-11-10 21:50:29,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:29,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:50:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:29,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:50:29,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:50:29,214 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-10 21:50:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:29,239 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2024-11-10 21:50:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:50:29,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-10 21:50:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:29,240 INFO L225 Difference]: With dead ends: 200 [2024-11-10 21:50:29,240 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 21:50:29,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-10 21:50:29,241 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 6 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:29,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 312 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 21:50:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-10 21:50:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 109 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2024-11-10 21:50:29,247 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 17 [2024-11-10 21:50:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:29,247 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2024-11-10 21:50:29,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-10 21:50:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2024-11-10 21:50:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 21:50:29,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:29,248 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:29,265 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-10 21:50:29,451 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-10 21:50:29,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:29,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash 760569346, now seen corresponding path program 2 times [2024-11-10 21:50:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:29,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449628453] [2024-11-10 21:50:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:29,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 21:50:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449628453] [2024-11-10 21:50:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449628453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369023992] [2024-11-10 21:50:29,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:50:29,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:29,740 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-10 21:50:29,741 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-10 21:50:29,929 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 21:50:29,929 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:50:29,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 21:50:29,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-10 21:50:29,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:29,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369023992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:29,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:50:29,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-10 21:50:29,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753350885] [2024-11-10 21:50:29,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:29,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:50:29,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:50:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:50:29,977 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-10 21:50:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:30,013 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-11-10 21:50:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:50:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 32 [2024-11-10 21:50:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:30,015 INFO L225 Difference]: With dead ends: 112 [2024-11-10 21:50:30,016 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 21:50:30,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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-10 21:50:30,017 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:30,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 293 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 21:50:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-10 21:50:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 107 states have internal predecessors, (122), 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-10 21:50:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-11-10 21:50:30,027 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 32 [2024-11-10 21:50:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:30,028 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-11-10 21:50:30,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-10 21:50:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-11-10 21:50:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 21:50:30,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:30,029 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:30,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 21:50:30,229 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-10 21:50:30,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:30,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1484794569, now seen corresponding path program 1 times [2024-11-10 21:50:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645060504] [2024-11-10 21:50:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 21:50:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-10 21:50:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:30,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645060504] [2024-11-10 21:50:30,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645060504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:30,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:30,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261415567] [2024-11-10 21:50:30,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:30,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:30,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:30,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:30,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:30,344 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-10 21:50:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:30,358 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2024-11-10 21:50:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:30,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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 41 [2024-11-10 21:50:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:30,359 INFO L225 Difference]: With dead ends: 189 [2024-11-10 21:50:30,359 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 21:50:30,360 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-10 21:50:30,360 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:30,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 200 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 21:50:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-10 21:50:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 111 states have internal predecessors, (126), 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-10 21:50:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2024-11-10 21:50:30,365 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 41 [2024-11-10 21:50:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:30,365 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2024-11-10 21:50:30,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-10 21:50:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2024-11-10 21:50:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 21:50:30,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:30,367 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:30,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 21:50:30,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:30,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1355163660, now seen corresponding path program 1 times [2024-11-10 21:50:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915479097] [2024-11-10 21:50:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 21:50:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:30,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915479097] [2024-11-10 21:50:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915479097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831864566] [2024-11-10 21:50:30,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:30,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:30,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:30,547 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-10 21:50:30,550 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-10 21:50:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:30,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 21:50:30,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:30,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:30,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831864566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:30,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:30,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 21:50:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815635399] [2024-11-10 21:50:30,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:30,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 21:50:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 21:50:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 21:50:30,898 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-10 21:50:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:30,955 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2024-11-10 21:50:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 21:50:30,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 45 [2024-11-10 21:50:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:30,956 INFO L225 Difference]: With dead ends: 234 [2024-11-10 21:50:30,956 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 21:50:30,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 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-10 21:50:30,957 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 6 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:30,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 411 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 21:50:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 21:50:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.248) internal successors, (156), 141 states have internal predecessors, (156), 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-10 21:50:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2024-11-10 21:50:30,963 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 45 [2024-11-10 21:50:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:30,963 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2024-11-10 21:50:30,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-10 21:50:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2024-11-10 21:50:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 21:50:30,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:30,965 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:30,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 21:50:31,165 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-10 21:50:31,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:31,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash -865639444, now seen corresponding path program 2 times [2024-11-10 21:50:31,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:31,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263141006] [2024-11-10 21:50:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:31,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:31,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263141006] [2024-11-10 21:50:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263141006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:50:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487327557] [2024-11-10 21:50:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:31,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:31,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:31,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:31,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:31,328 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-10 21:50:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:31,334 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2024-11-10 21:50:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 75 [2024-11-10 21:50:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:31,335 INFO L225 Difference]: With dead ends: 165 [2024-11-10 21:50:31,335 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 21:50:31,335 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-10 21:50:31,336 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 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-10 21:50:31,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 21:50:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-10 21:50:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 109 states have internal predecessors, (117), 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-10 21:50:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2024-11-10 21:50:31,340 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 75 [2024-11-10 21:50:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:31,340 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2024-11-10 21:50:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-10 21:50:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-10 21:50:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 21:50:31,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:31,342 INFO L215 NwaCegarLoop]: trace histogram [11, 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] [2024-11-10 21:50:31,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 21:50:31,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash 52939679, now seen corresponding path program 1 times [2024-11-10 21:50:31,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:31,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442166476] [2024-11-10 21:50:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442166476] [2024-11-10 21:50:31,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442166476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175553435] [2024-11-10 21:50:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:31,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:31,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:31,496 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-10 21:50:31,497 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-10 21:50:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:31,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:31,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:31,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:31,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175553435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:31,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:50:31,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-10 21:50:31,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026104485] [2024-11-10 21:50:31,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:31,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:50:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:31,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:50:31,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:50:31,777 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-10 21:50:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:31,797 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2024-11-10 21:50:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:50:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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 76 [2024-11-10 21:50:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:31,799 INFO L225 Difference]: With dead ends: 113 [2024-11-10 21:50:31,799 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 21:50:31,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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-10 21:50:31,799 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:31,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 177 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 21:50:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-10 21:50:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 108 states have internal predecessors, (116), 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-10 21:50:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2024-11-10 21:50:31,803 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 76 [2024-11-10 21:50:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:31,803 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2024-11-10 21:50:31,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-10 21:50:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2024-11-10 21:50:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 21:50:31,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:31,805 INFO L215 NwaCegarLoop]: trace histogram [11, 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] [2024-11-10 21:50:31,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 21:50:32,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:32,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:32,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1641128081, now seen corresponding path program 1 times [2024-11-10 21:50:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537562772] [2024-11-10 21:50:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:32,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-11-10 21:50:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537562772] [2024-11-10 21:50:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537562772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:32,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453734671] [2024-11-10 21:50:32,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:32,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:32,121 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-10 21:50:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:32,142 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2024-11-10 21:50:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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 77 [2024-11-10 21:50:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:32,143 INFO L225 Difference]: With dead ends: 129 [2024-11-10 21:50:32,143 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 21:50:32,143 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-10 21:50:32,144 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:32,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 117 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 21:50:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-10 21:50:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 122 states have internal predecessors, (133), 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-10 21:50:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2024-11-10 21:50:32,148 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 77 [2024-11-10 21:50:32,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:32,148 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2024-11-10 21:50:32,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-10 21:50:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2024-11-10 21:50:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 21:50:32,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:32,149 INFO L215 NwaCegarLoop]: trace histogram [11, 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] [2024-11-10 21:50:32,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 21:50:32,149 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:32,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1641130131, now seen corresponding path program 1 times [2024-11-10 21:50:32,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:32,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858109687] [2024-11-10 21:50:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:32,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-11-10 21:50:32,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:32,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858109687] [2024-11-10 21:50:32,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858109687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:32,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:32,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:32,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194245057] [2024-11-10 21:50:32,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:32,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:32,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:32,278 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-10 21:50:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:32,290 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2024-11-10 21:50:32,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:32,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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 77 [2024-11-10 21:50:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:32,292 INFO L225 Difference]: With dead ends: 125 [2024-11-10 21:50:32,292 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 21:50:32,292 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-10 21:50:32,293 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 120 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:32,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 21:50:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2024-11-10 21:50:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 113 states have (on average 1.1238938053097345) internal successors, (127), 117 states have internal predecessors, (127), 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-10 21:50:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-10 21:50:32,297 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 77 [2024-11-10 21:50:32,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:32,298 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-10 21:50:32,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-10 21:50:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-10 21:50:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 21:50:32,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:32,299 INFO L215 NwaCegarLoop]: trace histogram [11, 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-10 21:50:32,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 21:50:32,299 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:32,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2108145457, now seen corresponding path program 1 times [2024-11-10 21:50:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:32,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269996191] [2024-11-10 21:50:32,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:32,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269996191] [2024-11-10 21:50:32,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269996191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:32,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:32,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:32,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532408857] [2024-11-10 21:50:32,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:32,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:32,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:32,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:32,420 INFO L87 Difference]: Start difference. First operand 120 states and 129 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-10 21:50:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:32,435 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2024-11-10 21:50:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:32,436 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 78 [2024-11-10 21:50:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:32,436 INFO L225 Difference]: With dead ends: 132 [2024-11-10 21:50:32,437 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 21:50:32,437 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-10 21:50:32,437 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:32,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 21:50:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-10 21:50:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 117 states have (on average 1.1196581196581197) internal successors, (131), 121 states have internal predecessors, (131), 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-10 21:50:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2024-11-10 21:50:32,441 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 78 [2024-11-10 21:50:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:32,442 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2024-11-10 21:50:32,442 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-10 21:50:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2024-11-10 21:50:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:50:32,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:32,443 INFO L215 NwaCegarLoop]: trace histogram [11, 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, 1, 1, 1] [2024-11-10 21:50:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 21:50:32,443 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:32,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash -870767914, now seen corresponding path program 1 times [2024-11-10 21:50:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756596987] [2024-11-10 21:50:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:32,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756596987] [2024-11-10 21:50:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756596987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818479090] [2024-11-10 21:50:32,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:32,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:32,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:32,563 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-10 21:50:32,567 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-10 21:50:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:32,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:32,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:32,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818479090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:32,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:50:32,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-10 21:50:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250748725] [2024-11-10 21:50:32,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:32,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:50:32,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:32,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:50:32,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:50:32,853 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:32,870 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2024-11-10 21:50:32,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:50:32,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2024-11-10 21:50:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:32,871 INFO L225 Difference]: With dead ends: 125 [2024-11-10 21:50:32,871 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 21:50:32,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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-10 21:50:32,872 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:32,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 21:50:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-10 21:50:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 117 states have (on average 1.1111111111111112) internal successors, (130), 120 states have internal predecessors, (130), 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-10 21:50:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2024-11-10 21:50:32,875 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 83 [2024-11-10 21:50:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:32,875 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2024-11-10 21:50:32,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2024-11-10 21:50:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-10 21:50:32,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:32,876 INFO L215 NwaCegarLoop]: trace histogram [11, 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] [2024-11-10 21:50:32,891 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-10 21:50:33,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:33,077 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:33,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1224001557, now seen corresponding path program 1 times [2024-11-10 21:50:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:33,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254536180] [2024-11-10 21:50:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:33,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-11-10 21:50:33,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:33,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254536180] [2024-11-10 21:50:33,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254536180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:33,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:33,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610031630] [2024-11-10 21:50:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:33,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:33,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:33,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:33,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:33,189 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:33,200 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2024-11-10 21:50:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:33,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2024-11-10 21:50:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:33,201 INFO L225 Difference]: With dead ends: 123 [2024-11-10 21:50:33,201 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 21:50:33,202 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-10 21:50:33,203 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 116 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:33,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 116 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 21:50:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-10 21:50:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.1043478260869566) internal successors, (127), 117 states have internal predecessors, (127), 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-10 21:50:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-10 21:50:33,207 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 84 [2024-11-10 21:50:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:33,208 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-10 21:50:33,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-10 21:50:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 21:50:33,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:33,208 INFO L215 NwaCegarLoop]: trace histogram [11, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:33,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 21:50:33,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:33,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash 553572615, now seen corresponding path program 1 times [2024-11-10 21:50:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:33,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660589872] [2024-11-10 21:50:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:33,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:33,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660589872] [2024-11-10 21:50:33,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660589872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203567057] [2024-11-10 21:50:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:33,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:33,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:33,317 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-10 21:50:33,318 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-10 21:50:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:33,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:33,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:33,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203567057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:33,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 21:50:33,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330777537] [2024-11-10 21:50:33,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:33,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:50:33,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:33,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:50:33,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:50:33,640 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10 21:50:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:33,665 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2024-11-10 21:50:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:50:33,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 86 [2024-11-10 21:50:33,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:33,666 INFO L225 Difference]: With dead ends: 140 [2024-11-10 21:50:33,666 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 21:50:33,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-10 21:50:33,666 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 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-10 21:50:33,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 21:50:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-10 21:50:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0923076923076922) internal successors, (142), 132 states have internal predecessors, (142), 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-10 21:50:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2024-11-10 21:50:33,670 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 86 [2024-11-10 21:50:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:33,670 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2024-11-10 21:50:33,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10 21:50:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2024-11-10 21:50:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 21:50:33,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:33,671 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 4, 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] [2024-11-10 21:50:33,688 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-10 21:50:33,871 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-10 21:50:33,871 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:33,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:33,872 INFO L85 PathProgramCache]: Analyzing trace with hash 483857664, now seen corresponding path program 1 times [2024-11-10 21:50:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:33,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735053992] [2024-11-10 21:50:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:34,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-11-10 21:50:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:34,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735053992] [2024-11-10 21:50:34,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735053992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:34,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24064290] [2024-11-10 21:50:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:34,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:34,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:34,023 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-10 21:50:34,024 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-10 21:50:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:34,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:34,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-11-10 21:50:34,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-11-10 21:50:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24064290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:34,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 21:50:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957737758] [2024-11-10 21:50:34,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:34,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:50:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:34,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:50:34,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:50:34,353 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-10 21:50:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:34,377 INFO L93 Difference]: Finished difference Result 225 states and 246 transitions. [2024-11-10 21:50:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:50:34,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 90 [2024-11-10 21:50:34,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:34,378 INFO L225 Difference]: With dead ends: 225 [2024-11-10 21:50:34,378 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 21:50:34,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 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-10 21:50:34,378 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 6 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:34,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 21:50:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-10 21:50:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.075) internal successors, (172), 162 states have internal predecessors, (172), 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-10 21:50:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2024-11-10 21:50:34,382 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 90 [2024-11-10 21:50:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:34,382 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2024-11-10 21:50:34,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-10 21:50:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2024-11-10 21:50:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 21:50:34,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:34,383 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 5, 4, 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, 1, 1] [2024-11-10 21:50:34,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 21:50:34,587 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-10 21:50:34,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:34,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash 228635566, now seen corresponding path program 2 times [2024-11-10 21:50:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:34,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175248894] [2024-11-10 21:50:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:34,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175248894] [2024-11-10 21:50:34,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175248894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:34,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384841758] [2024-11-10 21:50:34,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:50:34,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:34,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:34,758 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-10 21:50:34,762 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-10 21:50:35,031 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 21:50:35,031 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:50:35,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 21:50:35,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-11-10 21:50:35,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384841758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:35,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:50:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-10 21:50:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243524091] [2024-11-10 21:50:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:35,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 21:50:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 21:50:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:50:35,112 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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-10 21:50:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:35,172 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2024-11-10 21:50:35,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:50:35,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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 101 [2024-11-10 21:50:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:35,173 INFO L225 Difference]: With dead ends: 208 [2024-11-10 21:50:35,173 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 21:50:35,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:50:35,174 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 65 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:35,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 187 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:50:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 21:50:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2024-11-10 21:50:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.06875) internal successors, (171), 162 states have internal predecessors, (171), 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-10 21:50:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2024-11-10 21:50:35,178 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 101 [2024-11-10 21:50:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:35,178 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2024-11-10 21:50:35,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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-10 21:50:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2024-11-10 21:50:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 21:50:35,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:35,179 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:35,197 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-10 21:50:35,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 21:50:35,380 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:35,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash -789290158, now seen corresponding path program 2 times [2024-11-10 21:50:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099842185] [2024-11-10 21:50:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2024-11-10 21:50:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099842185] [2024-11-10 21:50:35,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099842185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:35,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314822463] [2024-11-10 21:50:35,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:50:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:35,544 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-10 21:50:35,545 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-10 21:50:35,883 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 21:50:35,883 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:50:35,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 21:50:35,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 100 proven. 38 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-10 21:50:35,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 100 proven. 38 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-10 21:50:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314822463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:36,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:36,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-10 21:50:36,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630087718] [2024-11-10 21:50:36,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:36,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 21:50:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:36,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 21:50:36,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-10 21:50:36,005 INFO L87 Difference]: Start difference. First operand 165 states and 173 transitions. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 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-10 21:50:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:36,276 INFO L93 Difference]: Finished difference Result 300 states and 327 transitions. [2024-11-10 21:50:36,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 21:50:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 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 120 [2024-11-10 21:50:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:36,277 INFO L225 Difference]: With dead ends: 300 [2024-11-10 21:50:36,278 INFO L226 Difference]: Without dead ends: 225 [2024-11-10 21:50:36,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 21:50:36,279 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:36,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 377 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:50:36,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-10 21:50:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2024-11-10 21:50:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 220 states have (on average 1.0454545454545454) internal successors, (230), 221 states have internal predecessors, (230), 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-10 21:50:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 232 transitions. [2024-11-10 21:50:36,283 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 232 transitions. Word has length 120 [2024-11-10 21:50:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:36,284 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 232 transitions. [2024-11-10 21:50:36,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 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-10 21:50:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 232 transitions. [2024-11-10 21:50:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-10 21:50:36,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:36,285 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 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] [2024-11-10 21:50:36,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 21:50:36,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:36,486 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1152602005, now seen corresponding path program 1 times [2024-11-10 21:50:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356349445] [2024-11-10 21:50:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356349445] [2024-11-10 21:50:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356349445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281506286] [2024-11-10 21:50:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:36,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:36,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:36,771 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-10 21:50:36,772 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-10 21:50:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:37,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 21:50:37,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:37,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:37,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281506286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:37,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:37,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 21:50:37,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930627109] [2024-11-10 21:50:37,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:37,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 21:50:37,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:37,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 21:50:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 21:50:37,250 INFO L87 Difference]: Start difference. First operand 224 states and 232 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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-10 21:50:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:37,294 INFO L93 Difference]: Finished difference Result 259 states and 272 transitions. [2024-11-10 21:50:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 21:50:37,295 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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 159 [2024-11-10 21:50:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:37,295 INFO L225 Difference]: With dead ends: 259 [2024-11-10 21:50:37,296 INFO L226 Difference]: Without dead ends: 254 [2024-11-10 21:50:37,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 21:50:37,296 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:37,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 124 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-10 21:50:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-10 21:50:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.04) internal successors, (260), 251 states have internal predecessors, (260), 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-10 21:50:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 262 transitions. [2024-11-10 21:50:37,303 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 262 transitions. Word has length 159 [2024-11-10 21:50:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:37,303 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 262 transitions. [2024-11-10 21:50:37,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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-10 21:50:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 262 transitions. [2024-11-10 21:50:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 21:50:37,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:37,304 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:37,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 21:50:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:37,505 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:37,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 987543290, now seen corresponding path program 1 times [2024-11-10 21:50:37,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:37,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40866686] [2024-11-10 21:50:37,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:37,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 0 proven. 547 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-11-10 21:50:37,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40866686] [2024-11-10 21:50:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40866686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470303745] [2024-11-10 21:50:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:37,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:37,875 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-10 21:50:37,881 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-10 21:50:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:38,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:38,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 0 proven. 547 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-11-10 21:50:38,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 0 proven. 547 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-11-10 21:50:38,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470303745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:38,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:38,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 21:50:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94802102] [2024-11-10 21:50:38,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:38,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:50:38,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:38,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:50:38,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:50:38,547 INFO L87 Difference]: Start difference. First operand 254 states and 262 transitions. Second operand has 7 states, 6 states have (on average 13.0) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:38,591 INFO L93 Difference]: Finished difference Result 429 states and 445 transitions. [2024-11-10 21:50:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:50:38,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.0) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2024-11-10 21:50:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:38,593 INFO L225 Difference]: With dead ends: 429 [2024-11-10 21:50:38,593 INFO L226 Difference]: Without dead ends: 428 [2024-11-10 21:50:38,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 360 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-10 21:50:38,593 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:38,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-10 21:50:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2024-11-10 21:50:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 424 states have (on average 1.0377358490566038) internal successors, (440), 425 states have internal predecessors, (440), 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-10 21:50:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 442 transitions. [2024-11-10 21:50:38,602 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 442 transitions. Word has length 181 [2024-11-10 21:50:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:38,603 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 442 transitions. [2024-11-10 21:50:38,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.0) internal successors, (78), 7 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 442 transitions. [2024-11-10 21:50:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 21:50:38,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:38,604 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:38,623 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-10 21:50:38,804 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,SelfDestructingSolverStorable20 [2024-11-10 21:50:38,804 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 504913973, now seen corresponding path program 2 times [2024-11-10 21:50:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713893873] [2024-11-10 21:50:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:39,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:39,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713893873] [2024-11-10 21:50:39,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713893873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557431363] [2024-11-10 21:50:39,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:50:39,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:39,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:39,219 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-10 21:50:39,220 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-10 21:50:39,603 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 21:50:39,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:50:39,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:39,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-11-10 21:50:39,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:39,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557431363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:39,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:50:39,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2024-11-10 21:50:39,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297352836] [2024-11-10 21:50:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:39,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:39,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:39,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:39,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-10 21:50:39,634 INFO L87 Difference]: Start difference. First operand 428 states and 442 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:39,655 INFO L93 Difference]: Finished difference Result 488 states and 503 transitions. [2024-11-10 21:50:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2024-11-10 21:50:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:39,659 INFO L225 Difference]: With dead ends: 488 [2024-11-10 21:50:39,659 INFO L226 Difference]: Without dead ends: 429 [2024-11-10 21:50:39,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-10 21:50:39,660 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 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-10 21:50:39,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-10 21:50:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2024-11-10 21:50:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 425 states have (on average 1.0376470588235294) internal successors, (441), 426 states have internal predecessors, (441), 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-10 21:50:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 443 transitions. [2024-11-10 21:50:39,670 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 443 transitions. Word has length 189 [2024-11-10 21:50:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:39,670 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 443 transitions. [2024-11-10 21:50:39,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:39,670 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 443 transitions. [2024-11-10 21:50:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 21:50:39,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:39,672 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:39,688 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-10 21:50:39,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:39,872 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:39,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash 605825940, now seen corresponding path program 1 times [2024-11-10 21:50:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:39,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550677947] [2024-11-10 21:50:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-11-10 21:50:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550677947] [2024-11-10 21:50:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550677947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:40,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 21:50:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853866583] [2024-11-10 21:50:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:40,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:50:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:50:40,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:50:40,392 INFO L87 Difference]: Start difference. First operand 429 states and 443 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:40,429 INFO L93 Difference]: Finished difference Result 495 states and 511 transitions. [2024-11-10 21:50:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:50:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2024-11-10 21:50:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:40,431 INFO L225 Difference]: With dead ends: 495 [2024-11-10 21:50:40,431 INFO L226 Difference]: Without dead ends: 434 [2024-11-10 21:50:40,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:50:40,432 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:40,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-10 21:50:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2024-11-10 21:50:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 427 states have (on average 1.0374707259953162) internal successors, (443), 428 states have internal predecessors, (443), 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-10 21:50:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 445 transitions. [2024-11-10 21:50:40,441 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 445 transitions. Word has length 189 [2024-11-10 21:50:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:40,441 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 445 transitions. [2024-11-10 21:50:40,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 445 transitions. [2024-11-10 21:50:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 21:50:40,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:40,442 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:40,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 21:50:40,443 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:40,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1866193031, now seen corresponding path program 1 times [2024-11-10 21:50:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:40,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787703331] [2024-11-10 21:50:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:40,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787703331] [2024-11-10 21:50:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787703331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430073225] [2024-11-10 21:50:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:40,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:40,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:40,806 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-10 21:50:40,807 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-10 21:50:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:41,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 1783 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 21:50:41,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:41,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:41,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430073225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:41,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-10 21:50:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220010836] [2024-11-10 21:50:41,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:41,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 21:50:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:41,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 21:50:41,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-10 21:50:41,618 INFO L87 Difference]: Start difference. First operand 431 states and 445 transitions. Second operand has 25 states, 25 states have (on average 6.16) internal successors, (154), 25 states have internal predecessors, (154), 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-10 21:50:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:41,720 INFO L93 Difference]: Finished difference Result 496 states and 521 transitions. [2024-11-10 21:50:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 21:50:41,721 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.16) internal successors, (154), 25 states have internal predecessors, (154), 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 190 [2024-11-10 21:50:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:41,722 INFO L225 Difference]: With dead ends: 496 [2024-11-10 21:50:41,722 INFO L226 Difference]: Without dead ends: 491 [2024-11-10 21:50:41,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-10 21:50:41,723 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:41,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:50:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-10 21:50:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2024-11-10 21:50:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 487 states have (on average 1.0328542094455853) internal successors, (503), 488 states have internal predecessors, (503), 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-10 21:50:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 505 transitions. [2024-11-10 21:50:41,733 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 505 transitions. Word has length 190 [2024-11-10 21:50:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:41,733 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 505 transitions. [2024-11-10 21:50:41,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.16) internal successors, (154), 25 states have internal predecessors, (154), 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-10 21:50:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 505 transitions. [2024-11-10 21:50:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-10 21:50:41,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:41,735 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:41,752 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-10 21:50:41,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:41,940 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:41,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash 96262855, now seen corresponding path program 2 times [2024-11-10 21:50:41,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:41,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538434625] [2024-11-10 21:50:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 21:50:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:50:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538434625] [2024-11-10 21:50:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538434625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:50:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658079045] [2024-11-10 21:50:42,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:50:42,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:50:42,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:42,719 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-10 21:50:42,724 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-10 21:50:43,267 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 21:50:43,268 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:50:43,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 21:50:43,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:43,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:50:43,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658079045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:43,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:50:43,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2024-11-10 21:50:43,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065222285] [2024-11-10 21:50:43,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:43,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-10 21:50:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:50:43,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-10 21:50:43,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 21:50:43,989 INFO L87 Difference]: Start difference. First operand 491 states and 505 transitions. Second operand has 45 states, 45 states have (on average 5.733333333333333) internal successors, (258), 45 states have internal predecessors, (258), 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-10 21:50:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:44,160 INFO L93 Difference]: Finished difference Result 596 states and 629 transitions. [2024-11-10 21:50:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 21:50:44,161 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.733333333333333) internal successors, (258), 45 states have internal predecessors, (258), 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 250 [2024-11-10 21:50:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:44,162 INFO L225 Difference]: With dead ends: 596 [2024-11-10 21:50:44,163 INFO L226 Difference]: Without dead ends: 591 [2024-11-10 21:50:44,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 478 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 21:50:44,164 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:44,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 263 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:50:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-10 21:50:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2024-11-10 21:50:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 587 states have (on average 1.0272572402044293) internal successors, (603), 588 states have internal predecessors, (603), 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-10 21:50:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 605 transitions. [2024-11-10 21:50:44,175 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 605 transitions. Word has length 250 [2024-11-10 21:50:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:44,175 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 605 transitions. [2024-11-10 21:50:44,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.733333333333333) internal successors, (258), 45 states have internal predecessors, (258), 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-10 21:50:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 605 transitions. [2024-11-10 21:50:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-10 21:50:44,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:44,178 INFO L215 NwaCegarLoop]: trace histogram [43, 42, 42, 42, 42, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:44,198 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-10 21:50:44,382 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,SelfDestructingSolverStorable24 [2024-11-10 21:50:44,383 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash -449421689, now seen corresponding path program 3 times [2024-11-10 21:50:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:50:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771366672] [2024-11-10 21:50:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:50:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:50:44,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 21:50:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 21:50:45,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 21:50:45,875 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 21:50:45,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (24 of 25 remaining) [2024-11-10 21:50:45,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2024-11-10 21:50:45,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2024-11-10 21:50:45,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2024-11-10 21:50:45,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2024-11-10 21:50:45,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2024-11-10 21:50:45,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2024-11-10 21:50:45,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2024-11-10 21:50:45,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 21:50:45,882 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:45,993 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 21:50:45,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:50:45 BoogieIcfgContainer [2024-11-10 21:50:45,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 21:50:45,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 21:50:45,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 21:50:45,996 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 21:50:45,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:50:26" (3/4) ... [2024-11-10 21:50:45,999 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 21:50:45,999 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 21:50:46,000 INFO L158 Benchmark]: Toolchain (without parser) took 20978.39ms. Allocated memory was 138.4MB in the beginning and 610.3MB in the end (delta: 471.9MB). Free memory was 63.2MB in the beginning and 353.6MB in the end (delta: -290.4MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. [2024-11-10 21:50:46,000 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 101.4MB in the beginning and 101.2MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:50:46,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 775.45ms. Allocated memory was 138.4MB in the beginning and 232.8MB in the end (delta: 94.4MB). Free memory was 63.0MB in the beginning and 167.6MB in the end (delta: -104.5MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-11-10 21:50:46,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.00ms. Allocated memory is still 232.8MB. Free memory was 167.6MB in the beginning and 160.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 21:50:46,001 INFO L158 Benchmark]: Boogie Preprocessor took 71.84ms. Allocated memory is still 232.8MB. Free memory was 160.2MB in the beginning and 152.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 21:50:46,001 INFO L158 Benchmark]: IcfgBuilder took 860.11ms. Allocated memory is still 232.8MB. Free memory was 152.9MB in the beginning and 171.0MB in the end (delta: -18.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-10 21:50:46,003 INFO L158 Benchmark]: TraceAbstraction took 19186.95ms. Allocated memory was 232.8MB in the beginning and 610.3MB in the end (delta: 377.5MB). Free memory was 171.0MB in the beginning and 353.6MB in the end (delta: -182.6MB). Peak memory consumption was 351.0MB. Max. memory is 16.1GB. [2024-11-10 21:50:46,003 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 610.3MB. Free memory is still 353.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 21:50:46,005 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 138.4MB. Free memory was 101.4MB in the beginning and 101.2MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 775.45ms. Allocated memory was 138.4MB in the beginning and 232.8MB in the end (delta: 94.4MB). Free memory was 63.0MB in the beginning and 167.6MB in the end (delta: -104.5MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.00ms. Allocated memory is still 232.8MB. Free memory was 167.6MB in the beginning and 160.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.84ms. Allocated memory is still 232.8MB. Free memory was 160.2MB in the beginning and 152.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 860.11ms. Allocated memory is still 232.8MB. Free memory was 152.9MB in the beginning and 171.0MB in the end (delta: -18.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19186.95ms. Allocated memory was 232.8MB in the beginning and 610.3MB in the end (delta: 377.5MB). Free memory was 171.0MB in the beginning and 353.6MB in the end (delta: -182.6MB). Peak memory consumption was 351.0MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 610.3MB. Free memory is still 353.6MB. 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: 1162]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1162. Possible FailurePath: [L1136] static const char *applet_name; [L1137] static signed int bb_errno_location; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1304] char *a = malloc(11); [L1305] a[10] = 0 [L1306] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=0] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=1] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=2] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=3] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=4] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=5] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=6] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=7] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=8] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=9] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=10] [L1306] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1308] applet_name = a [L1309] bb_errno_location = __VERIFIER_nondet_int() [L1310] optind = 1 [L1311] int argc = __VERIFIER_nondet_int(); [L1312] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1312] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1313] EXPR argc+1 VAL [applet_name={-1:0}, argc=1, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1313] char **argv=malloc((argc+1)*sizeof(char*)); [L1314] EXPR argc+1 VAL [applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1314] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1315] argv[argc]=0 [L1316] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=0, mem_track={-13:0}, optind=1] [L1316] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2024-11-10 21:50:48,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:50:48,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:50:48,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:50:48,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:50:48,774 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:50:48,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-10 21:50:50,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:50:50,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:50:50,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-10 21:50:50,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78809835b/a887b3322c004757860aa7abd2c8a779/FLAG2d547a1dd [2024-11-10 21:50:50,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78809835b/a887b3322c004757860aa7abd2c8a779 [2024-11-10 21:50:50,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:50:50,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:50:50,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:50:50,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:50:50,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:50:50,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:50" (1/1) ... [2024-11-10 21:50:50,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363ca0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:50, skipping insertion in model container [2024-11-10 21:50:50,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:50" (1/1) ... [2024-11-10 21:50:50,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:50:50,986 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 21:50:51,003 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 21:50:51,004 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 21:50:51,015 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 21:50:51,039 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 21:50:51,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:50:51,070 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:50:51,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:50:51,247 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:50:51,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51 WrapperNode [2024-11-10 21:50:51,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:50:51,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:50:51,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:50:51,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:50:51,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,329 INFO L138 Inliner]: procedures = 351, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 658 [2024-11-10 21:50:51,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:50:51,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:50:51,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:50:51,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:50:51,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,386 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 2, 3, 3, 3, 6, 11, 4, 4, 4, 4, 3, 44, 355, 2]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 0, 3, 3, 3, 0, 0, 3, 3, 3, 3, 3, 42, 355, 0]. The 9 writes are split as follows [0, 2, 0, 0, 0, 2, 2, 0, 0, 0, 0, 0, 2, 0, 1]. [2024-11-10 21:50:51,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:50:51,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:50:51,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:50:51,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:50:51,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (1/1) ... [2024-11-10 21:50:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:50:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:50:51,461 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-10 21:50:51,463 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-10 21:50:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 21:50:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 21:50:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 21:50:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 21:50:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-10 21:50:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-10 21:50:51,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-10 21:50:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-10 21:50:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-10 21:50:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-10 21:50:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-10 21:50:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-10 21:50:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-10 21:50:51,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 21:50:51,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-10 21:50:51,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-10 21:50:51,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-10 21:50:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 21:50:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 21:50:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-10 21:50:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:50:51,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:50:51,724 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:50:51,726 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:50:52,355 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2024-11-10 21:50:52,375 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-10 21:50:52,376 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:50:52,389 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:50:52,389 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 21:50:52,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:50:52 BoogieIcfgContainer [2024-11-10 21:50:52,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:50:52,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:50:52,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:50:52,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:50:52,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:50:50" (1/3) ... [2024-11-10 21:50:52,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382ecbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:50:52, skipping insertion in model container [2024-11-10 21:50:52,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:51" (2/3) ... [2024-11-10 21:50:52,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382ecbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:50:52, skipping insertion in model container [2024-11-10 21:50:52,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:50:52" (3/3) ... [2024-11-10 21:50:52,398 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2024-11-10 21:50:52,420 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:50:52,420 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-10 21:50:52,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:50:52,486 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;@1d46a83a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:50:52,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-10 21:50:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 111 states have internal predecessors, (136), 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-10 21:50:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 21:50:52,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:52,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 21:50:52,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:52,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 173650705, now seen corresponding path program 1 times [2024-11-10 21:50:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:52,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499462297] [2024-11-10 21:50:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:52,528 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-10 21:50:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:52,534 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-10 21:50:52,537 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-10 21:50:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:52,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 21:50:52,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:52,882 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-10 21:50:52,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:52,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:52,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499462297] [2024-11-10 21:50:52,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499462297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:52,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:52,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 21:50:52,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009260858] [2024-11-10 21:50:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:52,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 21:50:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 21:50:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:50:52,913 INFO L87 Difference]: Start difference. First operand has 114 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 111 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 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-10 21:50:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:52,932 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2024-11-10 21:50:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 21:50:52,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 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-10 21:50:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:52,941 INFO L225 Difference]: With dead ends: 190 [2024-11-10 21:50:52,941 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 21:50:52,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-10 21:50:52,946 INFO L432 NwaCegarLoop]: 98 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, 98 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-10 21:50:52,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 21:50:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 21:50:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 81 states have internal predecessors, (96), 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-10 21:50:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-11-10 21:50:52,973 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 5 [2024-11-10 21:50:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:52,974 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-11-10 21:50:52,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 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-10 21:50:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-11-10 21:50:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 21:50:52,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:52,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 21:50:52,984 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-10 21:50:53,178 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-10 21:50:53,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:53,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1088204670, now seen corresponding path program 1 times [2024-11-10 21:50:53,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:53,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829967998] [2024-11-10 21:50:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:53,181 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-10 21:50:53,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:53,191 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-10 21:50:53,212 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-10 21:50:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:53,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:50:53,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:53,547 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-10 21:50:53,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:53,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829967998] [2024-11-10 21:50:53,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829967998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:53,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:53,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:53,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687856940] [2024-11-10 21:50:53,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:53,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:53,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:53,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:53,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:53,550 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10 21:50:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:53,577 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2024-11-10 21:50:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:53,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-10 21:50:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:53,578 INFO L225 Difference]: With dead ends: 166 [2024-11-10 21:50:53,579 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 21:50:53,579 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-10 21:50:53,580 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:53,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 21:50:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-10 21:50:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 85 states have internal predecessors, (100), 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-10 21:50:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-11-10 21:50:53,589 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 6 [2024-11-10 21:50:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:53,589 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-10 21:50:53,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10 21:50:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2024-11-10 21:50:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 21:50:53,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:53,590 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 21:50:53,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 21:50:53,790 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-10 21:50:53,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1711360493, now seen corresponding path program 1 times [2024-11-10 21:50:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578596596] [2024-11-10 21:50:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:53,792 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-10 21:50:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:53,798 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-10 21:50:53,799 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-10 21:50:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:54,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:54,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:54,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:54,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:54,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578596596] [2024-11-10 21:50:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578596596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:54,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:50:54,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-10 21:50:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421113634] [2024-11-10 21:50:54,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:54,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 21:50:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 21:50:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:50:54,133 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-10 21:50:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:54,208 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2024-11-10 21:50:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:50:54,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 11 [2024-11-10 21:50:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:54,213 INFO L225 Difference]: With dead ends: 172 [2024-11-10 21:50:54,214 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 21:50:54,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-10 21:50:54,215 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 3 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:54,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 363 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 21:50:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2024-11-10 21:50:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 87 states have internal predecessors, (102), 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-10 21:50:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2024-11-10 21:50:54,226 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 11 [2024-11-10 21:50:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:54,226 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-11-10 21:50:54,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-10 21:50:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2024-11-10 21:50:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 21:50:54,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:54,227 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:54,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 21:50:54,427 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-10 21:50:54,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:54,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1486753630, now seen corresponding path program 1 times [2024-11-10 21:50:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:54,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710119796] [2024-11-10 21:50:54,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:54,429 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-10 21:50:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:54,432 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-10 21:50:54,433 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-10 21:50:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:54,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:50:54,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:54,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:55,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710119796] [2024-11-10 21:50:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710119796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:55,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:50:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 21:50:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925570841] [2024-11-10 21:50:55,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:55,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:50:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:50:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:50:55,027 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 21:50:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:55,139 INFO L93 Difference]: Finished difference Result 186 states and 217 transitions. [2024-11-10 21:50:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:50:55,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 22 [2024-11-10 21:50:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:55,141 INFO L225 Difference]: With dead ends: 186 [2024-11-10 21:50:55,141 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 21:50:55,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 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-10 21:50:55,142 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 15 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:55,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 549 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:50:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 21:50:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-10 21:50:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 107 states have internal predecessors, (122), 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-10 21:50:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-11-10 21:50:55,154 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 22 [2024-11-10 21:50:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:55,154 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-11-10 21:50:55,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10 21:50:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-11-10 21:50:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 21:50:55,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:55,156 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:55,166 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-10 21:50:55,356 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-10 21:50:55,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:55,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1432851298, now seen corresponding path program 2 times [2024-11-10 21:50:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:55,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853923103] [2024-11-10 21:50:55,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:50:55,359 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-10 21:50:55,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:55,361 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-10 21:50:55,362 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-10 21:50:55,598 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 21:50:55,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:50:55,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:50:55,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 21:50:55,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:55,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853923103] [2024-11-10 21:50:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853923103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:55,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:50:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39375137] [2024-11-10 21:50:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:55,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:50:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:55,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:50:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:50:55,654 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-10 21:50:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:55,866 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2024-11-10 21:50:55,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:50:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 42 [2024-11-10 21:50:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:55,872 INFO L225 Difference]: With dead ends: 110 [2024-11-10 21:50:55,873 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 21:50:55,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-10 21:50:55,873 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 80 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:55,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 257 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:50:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 21:50:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-10 21:50:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.188118811881188) internal successors, (120), 105 states have internal predecessors, (120), 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-10 21:50:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-11-10 21:50:55,879 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 42 [2024-11-10 21:50:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:55,879 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-11-10 21:50:55,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-10 21:50:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-11-10 21:50:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 21:50:55,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:55,882 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:50:55,894 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-10 21:50:56,083 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-10 21:50:56,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:56,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:56,084 INFO L85 PathProgramCache]: Analyzing trace with hash 819056475, now seen corresponding path program 1 times [2024-11-10 21:50:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480993877] [2024-11-10 21:50:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:56,085 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-10 21:50:56,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:56,087 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-10 21:50:56,088 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-10 21:50:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:56,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 21:50:56,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:56,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:50:57,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480993877] [2024-11-10 21:50:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480993877] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:57,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:50:57,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-10 21:50:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222867218] [2024-11-10 21:50:57,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:57,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 21:50:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 21:50:57,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-10 21:50:57,152 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 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-10 21:50:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:57,440 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2024-11-10 21:50:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 21:50:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 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 52 [2024-11-10 21:50:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:57,441 INFO L225 Difference]: With dead ends: 202 [2024-11-10 21:50:57,442 INFO L226 Difference]: Without dead ends: 128 [2024-11-10 21:50:57,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 88 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-10 21:50:57,443 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 15 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:57,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 749 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:50:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-10 21:50:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-10 21:50:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 121 states have (on average 1.1570247933884297) internal successors, (140), 125 states have internal predecessors, (140), 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-10 21:50:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2024-11-10 21:50:57,449 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 52 [2024-11-10 21:50:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:57,449 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2024-11-10 21:50:57,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 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-10 21:50:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2024-11-10 21:50:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 21:50:57,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:57,450 INFO L215 NwaCegarLoop]: trace histogram [11, 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] [2024-11-10 21:50:57,461 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-10 21:50:57,657 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-10 21:50:57,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:57,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1164321307, now seen corresponding path program 2 times [2024-11-10 21:50:57,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:57,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728328940] [2024-11-10 21:50:57,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:50:57,659 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-10 21:50:57,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:57,662 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-10 21:50:57,663 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-10 21:50:57,935 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 21:50:57,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:50:57,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:50:57,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:57,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:57,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:57,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728328940] [2024-11-10 21:50:57,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728328940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:57,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:57,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:50:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134849340] [2024-11-10 21:50:57,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:57,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:57,965 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10 21:50:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:57,994 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2024-11-10 21:50:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:57,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-10 21:50:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:57,995 INFO L225 Difference]: With dead ends: 195 [2024-11-10 21:50:57,995 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 21:50:57,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-10 21:50:57,996 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:57,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:50:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 21:50:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-10 21:50:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.152) internal successors, (144), 129 states have internal predecessors, (144), 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-10 21:50:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2024-11-10 21:50:58,002 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 72 [2024-11-10 21:50:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:58,003 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2024-11-10 21:50:58,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10 21:50:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2024-11-10 21:50:58,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 21:50:58,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:58,004 INFO L215 NwaCegarLoop]: trace histogram [11, 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] [2024-11-10 21:50:58,017 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-10 21:50:58,205 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-10 21:50:58,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:58,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1641130131, now seen corresponding path program 1 times [2024-11-10 21:50:58,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:58,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955063619] [2024-11-10 21:50:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:58,206 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-10 21:50:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:58,209 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-10 21:50:58,210 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-10 21:50:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:58,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:50:58,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:58,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:50:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:58,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:58,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955063619] [2024-11-10 21:50:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955063619] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:50:58,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:50:58,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-10 21:50:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324103656] [2024-11-10 21:50:58,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:50:58,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 21:50:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:58,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 21:50:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:50:58,636 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:58,773 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2024-11-10 21:50:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:50:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2024-11-10 21:50:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:58,775 INFO L225 Difference]: With dead ends: 205 [2024-11-10 21:50:58,775 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 21:50:58,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 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-10 21:50:58,776 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:50:58,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 263 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:50:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 21:50:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2024-11-10 21:50:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 128 states have (on average 1.140625) internal successors, (146), 131 states have internal predecessors, (146), 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-10 21:50:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2024-11-10 21:50:58,784 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 77 [2024-11-10 21:50:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:58,785 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2024-11-10 21:50:58,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:50:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2024-11-10 21:50:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 21:50:58,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:58,787 INFO L215 NwaCegarLoop]: trace histogram [11, 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-10 21:50:58,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 21:50:58,990 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-10 21:50:58,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash -927999726, now seen corresponding path program 1 times [2024-11-10 21:50:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673347698] [2024-11-10 21:50:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:58,992 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-10 21:50:58,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:58,993 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-10 21:50:58,995 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-10 21:50:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:59,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:50:59,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:59,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:59,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673347698] [2024-11-10 21:50:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673347698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:59,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:59,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:50:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454873675] [2024-11-10 21:50:59,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:59,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:50:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:59,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:50:59,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:50:59,358 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-10 21:50:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:50:59,371 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2024-11-10 21:50:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:50:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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 79 [2024-11-10 21:50:59,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:50:59,373 INFO L225 Difference]: With dead ends: 148 [2024-11-10 21:50:59,373 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 21:50:59,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 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-10 21:50:59,373 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-10 21:50:59,374 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-10 21:50:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 21:50:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-10 21:50:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 129 states have (on average 1.1395348837209303) internal successors, (147), 132 states have internal predecessors, (147), 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-10 21:50:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2024-11-10 21:50:59,379 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 79 [2024-11-10 21:50:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:50:59,379 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2024-11-10 21:50:59,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-10 21:50:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2024-11-10 21:50:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 21:50:59,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:50:59,381 INFO L215 NwaCegarLoop]: trace histogram [11, 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-10 21:50:59,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 21:50:59,581 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-10 21:50:59,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:50:59,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:50:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash 814810609, now seen corresponding path program 1 times [2024-11-10 21:50:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:50:59,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663536463] [2024-11-10 21:50:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:50:59,582 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-10 21:50:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:50:59,586 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-10 21:50:59,588 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-10 21:50:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:50:59,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 21:50:59,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:50:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:50:59,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:50:59,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:50:59,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663536463] [2024-11-10 21:50:59,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663536463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:50:59,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:50:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 21:50:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476722018] [2024-11-10 21:50:59,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:50:59,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:50:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:50:59,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:50:59,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:50:59,972 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-10 21:51:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:00,178 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2024-11-10 21:51:00,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:51:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 79 [2024-11-10 21:51:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:00,180 INFO L225 Difference]: With dead ends: 155 [2024-11-10 21:51:00,180 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 21:51:00,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:51:00,180 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:00,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 338 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:51:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 21:51:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-11-10 21:51:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 134 states have internal predecessors, (149), 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-10 21:51:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2024-11-10 21:51:00,211 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 79 [2024-11-10 21:51:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:00,211 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2024-11-10 21:51:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-10 21:51:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2024-11-10 21:51:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 21:51:00,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:00,213 INFO L215 NwaCegarLoop]: trace histogram [11, 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, 1] [2024-11-10 21:51:00,227 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-10 21:51:00,413 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-10 21:51:00,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 529242066, now seen corresponding path program 1 times [2024-11-10 21:51:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611706842] [2024-11-10 21:51:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:51:00,415 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-10 21:51:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:00,416 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-10 21:51:00,418 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-10 21:51:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:51:00,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:51:00,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:51:00,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:51:00,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:00,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611706842] [2024-11-10 21:51:00,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611706842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:51:00,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:51:00,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:51:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783032880] [2024-11-10 21:51:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:51:00,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:51:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:51:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:51:00,772 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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-10 21:51:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:00,800 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2024-11-10 21:51:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:51:00,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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 80 [2024-11-10 21:51:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:00,801 INFO L225 Difference]: With dead ends: 148 [2024-11-10 21:51:00,801 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 21:51:00,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 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-10 21:51:00,802 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:00,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:51:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 21:51:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-11-10 21:51:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 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-10 21:51:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2024-11-10 21:51:00,806 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 80 [2024-11-10 21:51:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:00,806 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2024-11-10 21:51:00,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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-10 21:51:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2024-11-10 21:51:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 21:51:00,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:00,808 INFO L215 NwaCegarLoop]: trace histogram [11, 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, 1, 1] [2024-11-10 21:51:00,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 21:51:01,008 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-10 21:51:01,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:01,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash -666279922, now seen corresponding path program 1 times [2024-11-10 21:51:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:01,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95945353] [2024-11-10 21:51:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:51:01,009 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-10 21:51:01,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:01,012 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-10 21:51:01,013 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-10 21:51:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:51:01,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:51:01,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:51:01,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:51:01,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95945353] [2024-11-10 21:51:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95945353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:51:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:51:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:51:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934275052] [2024-11-10 21:51:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:51:01,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:51:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:01,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:51:01,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:51:01,323 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-10 21:51:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:01,333 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2024-11-10 21:51:01,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:51:01,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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 81 [2024-11-10 21:51:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:01,334 INFO L225 Difference]: With dead ends: 166 [2024-11-10 21:51:01,334 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 21:51:01,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 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-10 21:51:01,335 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 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-10 21:51:01,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:51:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 21:51:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-10 21:51:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0884955752212389) internal successors, (123), 115 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:51:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2024-11-10 21:51:01,352 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 81 [2024-11-10 21:51:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:01,352 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2024-11-10 21:51:01,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-10 21:51:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2024-11-10 21:51:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:51:01,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:01,353 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 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-10 21:51:01,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 21:51:01,553 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-10 21:51:01,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash 125648467, now seen corresponding path program 1 times [2024-11-10 21:51:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990894029] [2024-11-10 21:51:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:51:01,554 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-10 21:51:01,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:01,557 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-10 21:51:01,558 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-10 21:51:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:51:01,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:51:01,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:51:01,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:51:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:51:02,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990894029] [2024-11-10 21:51:02,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990894029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:51:02,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:51:02,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 21:51:02,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243618161] [2024-11-10 21:51:02,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:51:02,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:51:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:02,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:51:02,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:51:02,032 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:51:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:02,275 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2024-11-10 21:51:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:51:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2024-11-10 21:51:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:02,276 INFO L225 Difference]: With dead ends: 190 [2024-11-10 21:51:02,276 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 21:51:02,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:51:02,277 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:02,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 346 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:51:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 21:51:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-10 21:51:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.0751879699248121) internal successors, (143), 135 states have internal predecessors, (143), 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-10 21:51:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2024-11-10 21:51:02,281 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 83 [2024-11-10 21:51:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:02,282 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2024-11-10 21:51:02,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:51:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2024-11-10 21:51:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 21:51:02,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:02,282 INFO L215 NwaCegarLoop]: trace histogram [11, 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] [2024-11-10 21:51:02,294 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-10 21:51:02,486 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-10 21:51:02,487 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:02,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:02,487 INFO L85 PathProgramCache]: Analyzing trace with hash -243748565, now seen corresponding path program 1 times [2024-11-10 21:51:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999799458] [2024-11-10 21:51:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:51:02,488 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-10 21:51:02,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:02,491 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-10 21:51:02,492 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-10 21:51:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:51:02,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 21:51:02,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:51:02,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:51:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:51:02,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:02,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999799458] [2024-11-10 21:51:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999799458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:51:02,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:51:02,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-10 21:51:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617346728] [2024-11-10 21:51:02,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:51:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 21:51:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:02,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 21:51:02,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:51:02,920 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:51:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:02,979 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2024-11-10 21:51:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:51:02,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-10 21:51:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:02,980 INFO L225 Difference]: With dead ends: 151 [2024-11-10 21:51:02,980 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 21:51:02,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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-10 21:51:02,981 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 278 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-10 21:51:02,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 278 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:51:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 21:51:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2024-11-10 21:51:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 136 states have (on average 1.0661764705882353) internal successors, (145), 137 states have internal predecessors, (145), 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-10 21:51:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2024-11-10 21:51:02,985 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 85 [2024-11-10 21:51:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2024-11-10 21:51:02,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:51:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2024-11-10 21:51:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 21:51:02,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:02,986 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 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-10 21:51:03,002 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-10 21:51:03,190 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-10 21:51:03,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:03,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash 705716942, now seen corresponding path program 1 times [2024-11-10 21:51:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:03,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703548683] [2024-11-10 21:51:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:51:03,192 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-10 21:51:03,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:03,193 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-10 21:51:03,194 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-10 21:51:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:51:03,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:51:03,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:51:03,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:51:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-10 21:51:03,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703548683] [2024-11-10 21:51:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703548683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:51:03,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:51:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 21:51:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672253340] [2024-11-10 21:51:03,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:51:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:51:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:51:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:51:03,626 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-10 21:51:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:03,736 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2024-11-10 21:51:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:51:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 92 [2024-11-10 21:51:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:03,737 INFO L225 Difference]: With dead ends: 165 [2024-11-10 21:51:03,737 INFO L226 Difference]: Without dead ends: 160 [2024-11-10 21:51:03,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:51:03,738 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:03,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:51:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-10 21:51:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-10 21:51:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 156 states have (on average 1.0576923076923077) internal successors, (165), 157 states have internal predecessors, (165), 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-10 21:51:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2024-11-10 21:51:03,743 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 92 [2024-11-10 21:51:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:03,743 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2024-11-10 21:51:03,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-10 21:51:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2024-11-10 21:51:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 21:51:03,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:03,744 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:51:03,757 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 (16)] Ended with exit code 0 [2024-11-10 21:51:03,945 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-10 21:51:03,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:03,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:03,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1635080109, now seen corresponding path program 2 times [2024-11-10 21:51:03,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:03,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341663057] [2024-11-10 21:51:03,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:51:03,946 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-10 21:51:03,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:03,949 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-10 21:51:03,966 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-10 21:51:04,276 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 21:51:04,277 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:51:04,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 21:51:04,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-10 21:51:04,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:51:04,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341663057] [2024-11-10 21:51:04,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341663057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:51:04,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:51:04,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:51:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470978807] [2024-11-10 21:51:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:51:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:51:04,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:04,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:51:04,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:51:04,347 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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-10 21:51:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:04,573 INFO L93 Difference]: Finished difference Result 199 states and 208 transitions. [2024-11-10 21:51:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:51:04,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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 103 [2024-11-10 21:51:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:04,575 INFO L225 Difference]: With dead ends: 199 [2024-11-10 21:51:04,575 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 21:51:04,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-10 21:51:04,576 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:04,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:51:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 21:51:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2024-11-10 21:51:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.0569948186528497) internal successors, (204), 194 states have internal predecessors, (204), 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-10 21:51:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 206 transitions. [2024-11-10 21:51:04,581 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 206 transitions. Word has length 103 [2024-11-10 21:51:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:04,581 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 206 transitions. [2024-11-10 21:51:04,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 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-10 21:51:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 206 transitions. [2024-11-10 21:51:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 21:51:04,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:04,582 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:51:04,592 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 (17)] Ended with exit code 0 [2024-11-10 21:51:04,782 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-10 21:51:04,783 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:04,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1931060722, now seen corresponding path program 2 times [2024-11-10 21:51:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:04,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43600618] [2024-11-10 21:51:04,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:51:04,784 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-10 21:51:04,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:04,786 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-10 21:51:04,787 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-10 21:51:05,067 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 21:51:05,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:51:05,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 21:51:05,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-10 21:51:05,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:51:05,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:05,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43600618] [2024-11-10 21:51:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43600618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:51:05,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:51:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 21:51:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062696259] [2024-11-10 21:51:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:51:05,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 21:51:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:05,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 21:51:05,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:51:05,138 INFO L87 Difference]: Start difference. First operand 197 states and 206 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:51:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:05,451 INFO L93 Difference]: Finished difference Result 253 states and 266 transitions. [2024-11-10 21:51:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:51:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-10 21:51:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:05,452 INFO L225 Difference]: With dead ends: 253 [2024-11-10 21:51:05,452 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 21:51:05,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 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-10 21:51:05,453 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:05,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 184 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 21:51:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 21:51:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2024-11-10 21:51:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.0518134715025906) internal successors, (203), 194 states have internal predecessors, (203), 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-10 21:51:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2024-11-10 21:51:05,459 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 112 [2024-11-10 21:51:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:05,459 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2024-11-10 21:51:05,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 21:51:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2024-11-10 21:51:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 21:51:05,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:05,460 INFO L215 NwaCegarLoop]: trace histogram [14, 12, 12, 12, 12, 11, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:51:05,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-10 21:51:05,663 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-10 21:51:05,664 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash -674169734, now seen corresponding path program 1 times [2024-11-10 21:51:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:05,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397702368] [2024-11-10 21:51:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:51:05,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 21:51:05,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:05,667 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-10 21:51:05,671 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-10 21:51:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:51:06,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 21:51:06,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 208 proven. 87 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-11-10 21:51:06,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:51:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 208 proven. 87 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-11-10 21:51:06,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397702368] [2024-11-10 21:51:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397702368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:51:06,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:51:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-10 21:51:06,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483444262] [2024-11-10 21:51:06,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:51:06,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 21:51:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:06,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 21:51:06,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-10 21:51:06,433 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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-10 21:51:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:07,121 INFO L93 Difference]: Finished difference Result 334 states and 356 transitions. [2024-11-10 21:51:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 21:51:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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 141 [2024-11-10 21:51:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:07,123 INFO L225 Difference]: With dead ends: 334 [2024-11-10 21:51:07,123 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 21:51:07,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 266 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-10 21:51:07,124 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:07,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 480 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 21:51:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 21:51:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-10 21:51:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.0429184549356223) internal successors, (243), 234 states have internal predecessors, (243), 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-10 21:51:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 245 transitions. [2024-11-10 21:51:07,131 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 245 transitions. Word has length 141 [2024-11-10 21:51:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:07,131 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 245 transitions. [2024-11-10 21:51:07,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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-10 21:51:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 245 transitions. [2024-11-10 21:51:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:51:07,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:07,132 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 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-10 21:51:07,148 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-10 21:51:07,332 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-10 21:51:07,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:07,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash 385947591, now seen corresponding path program 1 times [2024-11-10 21:51:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143587855] [2024-11-10 21:51:07,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:51:07,334 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-10 21:51:07,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:07,336 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-10 21:51:07,337 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-10 21:51:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:51:08,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 21:51:08,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:51:08,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:51:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:51:08,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143587855] [2024-11-10 21:51:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143587855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:51:08,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:51:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-10 21:51:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191873079] [2024-11-10 21:51:08,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:51:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 21:51:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 21:51:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-10 21:51:08,319 INFO L87 Difference]: Start difference. First operand 237 states and 245 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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-10 21:51:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:08,765 INFO L93 Difference]: Finished difference Result 282 states and 297 transitions. [2024-11-10 21:51:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 21:51:08,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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 170 [2024-11-10 21:51:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:08,766 INFO L225 Difference]: With dead ends: 282 [2024-11-10 21:51:08,766 INFO L226 Difference]: Without dead ends: 277 [2024-11-10 21:51:08,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2024-11-10 21:51:08,767 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:08,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 546 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 21:51:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-10 21:51:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-10 21:51:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 273 states have (on average 1.0366300366300367) internal successors, (283), 274 states have internal predecessors, (283), 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-10 21:51:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 285 transitions. [2024-11-10 21:51:08,775 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 285 transitions. Word has length 170 [2024-11-10 21:51:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:08,775 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 285 transitions. [2024-11-10 21:51:08,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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-10 21:51:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 285 transitions. [2024-11-10 21:51:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 21:51:08,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:08,776 INFO L215 NwaCegarLoop]: trace histogram [22, 20, 20, 20, 20, 11, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:51:08,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-10 21:51:08,976 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-10 21:51:08,977 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:08,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:08,977 INFO L85 PathProgramCache]: Analyzing trace with hash 987543290, now seen corresponding path program 2 times [2024-11-10 21:51:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:08,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448076735] [2024-11-10 21:51:08,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:51:08,978 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-10 21:51:08,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:08,980 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-10 21:51:08,998 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-10 21:51:09,436 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 21:51:09,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:51:09,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 21:51:09,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-11-10 21:51:09,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:51:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-11-10 21:51:09,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448076735] [2024-11-10 21:51:09,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448076735] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 21:51:09,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:51:09,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-10 21:51:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376161027] [2024-11-10 21:51:09,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:51:09,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:51:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:51:09,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:51:09,812 INFO L87 Difference]: Start difference. First operand 277 states and 285 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-10 21:51:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:09,882 INFO L93 Difference]: Finished difference Result 277 states and 285 transitions. [2024-11-10 21:51:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:51:09,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 181 [2024-11-10 21:51:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:09,884 INFO L225 Difference]: With dead ends: 277 [2024-11-10 21:51:09,884 INFO L226 Difference]: Without dead ends: 276 [2024-11-10 21:51:09,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 355 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-10 21:51:09,884 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:09,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:51:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-10 21:51:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 221. [2024-11-10 21:51:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 218 states have (on average 1.036697247706422) internal successors, (226), 218 states have internal predecessors, (226), 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-10 21:51:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 228 transitions. [2024-11-10 21:51:09,891 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 228 transitions. Word has length 181 [2024-11-10 21:51:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:09,891 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 228 transitions. [2024-11-10 21:51:09,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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-10 21:51:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 228 transitions. [2024-11-10 21:51:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 21:51:09,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:09,892 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:51:09,906 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 (21)] Forceful destruction successful, exit code 0 [2024-11-10 21:51:10,096 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-10 21:51:10,097 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:10,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:10,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1857111737, now seen corresponding path program 2 times [2024-11-10 21:51:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248739413] [2024-11-10 21:51:10,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 21:51:10,098 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-10 21:51:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:10,099 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-10 21:51:10,099 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-10 21:51:21,481 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 21:51:21,482 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 21:51:21,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 21:51:21,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:51:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:51:21,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:51:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-11-10 21:51:22,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 21:51:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248739413] [2024-11-10 21:51:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248739413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:51:22,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 21:51:22,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-10 21:51:22,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762628884] [2024-11-10 21:51:22,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 21:51:22,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 21:51:22,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 21:51:22,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 21:51:22,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-11-10 21:51:22,221 INFO L87 Difference]: Start difference. First operand 221 states and 228 transitions. Second operand has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 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-10 21:51:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:51:24,159 INFO L93 Difference]: Finished difference Result 306 states and 328 transitions. [2024-11-10 21:51:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 21:51:24,160 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 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 210 [2024-11-10 21:51:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:51:24,162 INFO L225 Difference]: With dead ends: 306 [2024-11-10 21:51:24,162 INFO L226 Difference]: Without dead ends: 301 [2024-11-10 21:51:24,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2024-11-10 21:51:24,163 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 21:51:24,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1092 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 21:51:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-10 21:51:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-11-10 21:51:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 298 states have (on average 1.0268456375838926) internal successors, (306), 298 states have internal predecessors, (306), 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-10 21:51:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 308 transitions. [2024-11-10 21:51:24,185 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 308 transitions. Word has length 210 [2024-11-10 21:51:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:51:24,185 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 308 transitions. [2024-11-10 21:51:24,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 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-10 21:51:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 308 transitions. [2024-11-10 21:51:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-10 21:51:24,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:51:24,186 INFO L215 NwaCegarLoop]: trace histogram [31, 30, 30, 30, 30, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:51:24,208 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 (22)] Ended with exit code 0 [2024-11-10 21:51:24,387 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-10 21:51:24,387 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 22 more)] === [2024-11-10 21:51:24,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:51:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -372540345, now seen corresponding path program 3 times [2024-11-10 21:51:24,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 21:51:24,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126685953] [2024-11-10 21:51:24,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 21:51:24,388 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-10 21:51:24,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 21:51:24,389 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-10 21:51:24,391 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