./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:06:06,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:06:07,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:06:07,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:06:07,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:06:07,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:06:07,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:06:07,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:06:07,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:06:07,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:06:07,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:06:07,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:06:07,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:06:07,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:06:07,102 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:06:07,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:06:07,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:06:07,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:06:07,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:06:07,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:06:07,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:06:07,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:06:07,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:06:07,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:06:07,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:06:07,108 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:06:07,109 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:06:07,109 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:06:07,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:06:07,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:06:07,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:06:07,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:06:07,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:06:07,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:06:07,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:06:07,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:06:07,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:06:07,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:06:07,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:06:07,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:06:07,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:06:07,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:06:07,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:06:07,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:06:07,114 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2024-11-17 04:06:07,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:06:07,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:06:07,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:06:07,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:06:07,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:06:07,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2024-11-17 04:06:08,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:06:09,209 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:06:09,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2024-11-17 04:06:09,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de195492/a340c6163c094e38aa406d36f993c5a6/FLAGa4ec11f29 [2024-11-17 04:06:09,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de195492/a340c6163c094e38aa406d36f993c5a6 [2024-11-17 04:06:09,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:06:09,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:06:09,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:06:09,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:06:09,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:06:09,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afb1072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09, skipping insertion in model container [2024-11-17 04:06:09,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:06:09,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:06:09,642 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:06:09,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:06:09,723 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:06:09,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09 WrapperNode [2024-11-17 04:06:09,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:06:09,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:06:09,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:06:09,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:06:09,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,773 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-11-17 04:06:09,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:06:09,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:06:09,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:06:09,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:06:09,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,810 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2024-11-17 04:06:09,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:06:09,840 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:06:09,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:06:09,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:06:09,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (1/1) ... [2024-11-17 04:06:09,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:06:09,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:09,875 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-17 04:06:09,884 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-17 04:06:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 04:06:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 04:06:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 04:06:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 04:06:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 04:06:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 04:06:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 04:06:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-17 04:06:09,923 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-17 04:06:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:06:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 04:06:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 04:06:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 04:06:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 04:06:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 04:06:09,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 04:06:09,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 04:06:09,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 04:06:09,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 04:06:09,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 04:06:09,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 04:06:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:06:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 04:06:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 04:06:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:06:09,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:06:10,061 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:06:10,063 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:06:10,339 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc #t~mem5.base, #t~mem5.offset; [2024-11-17 04:06:10,410 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2024-11-17 04:06:10,445 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-17 04:06:10,445 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:06:10,463 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:06:10,464 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:06:10,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:10 BoogieIcfgContainer [2024-11-17 04:06:10,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:06:10,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:06:10,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:06:10,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:06:10,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:06:09" (1/3) ... [2024-11-17 04:06:10,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544227b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:06:10, skipping insertion in model container [2024-11-17 04:06:10,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:06:09" (2/3) ... [2024-11-17 04:06:10,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544227b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:06:10, skipping insertion in model container [2024-11-17 04:06:10,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:10" (3/3) ... [2024-11-17 04:06:10,475 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2024-11-17 04:06:10,493 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:06:10,493 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 04:06:10,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:06:10,560 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;@7ad5f076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:06:10,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 04:06:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 49 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:06:10,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:10,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:10,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:10,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash 756823796, now seen corresponding path program 1 times [2024-11-17 04:06:10,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:10,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141495594] [2024-11-17 04:06:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:10,969 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-17 04:06:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141495594] [2024-11-17 04:06:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141495594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:10,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:10,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:06:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745283872] [2024-11-17 04:06:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:06:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:06:11,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:06:11,006 INFO L87 Difference]: Start difference. First operand has 53 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 49 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:11,067 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2024-11-17 04:06:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:06:11,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 04:06:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:11,075 INFO L225 Difference]: With dead ends: 109 [2024-11-17 04:06:11,075 INFO L226 Difference]: Without dead ends: 51 [2024-11-17 04:06:11,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:06:11,081 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:11,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-17 04:06:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-17 04:06:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 46 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-11-17 04:06:11,114 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 12 [2024-11-17 04:06:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:11,115 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-11-17 04:06:11,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-11-17 04:06:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 04:06:11,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:11,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:11,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:06:11,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:11,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1783102669, now seen corresponding path program 1 times [2024-11-17 04:06:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118675822] [2024-11-17 04:06:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 04:06:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118675822] [2024-11-17 04:06:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118675822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:11,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 04:06:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723364839] [2024-11-17 04:06:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:06:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:06:11,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:06:11,313 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:11,378 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2024-11-17 04:06:11,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:06:11,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 04:06:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:11,381 INFO L225 Difference]: With dead ends: 135 [2024-11-17 04:06:11,381 INFO L226 Difference]: Without dead ends: 87 [2024-11-17 04:06:11,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-17 04:06:11,385 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 37 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:11,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 159 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-17 04:06:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-17 04:06:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.380281690140845) internal successors, (98), 76 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2024-11-17 04:06:11,404 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 17 [2024-11-17 04:06:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:11,404 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2024-11-17 04:06:11,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2024-11-17 04:06:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 04:06:11,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:11,406 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:11,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:06:11,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:11,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:11,407 INFO L85 PathProgramCache]: Analyzing trace with hash -13848690, now seen corresponding path program 1 times [2024-11-17 04:06:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:11,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604868347] [2024-11-17 04:06:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:11,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:11,658 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-17 04:06:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604868347] [2024-11-17 04:06:11,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604868347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:11,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496421118] [2024-11-17 04:06:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:11,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:11,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:11,664 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-17 04:06:11,666 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-17 04:06:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:11,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 04:06:11,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:11,867 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-17 04:06:11,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:06:11,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496421118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:11,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:06:11,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-17 04:06:11,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716513641] [2024-11-17 04:06:11,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:11,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:06:11,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:11,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:06:11,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:06:11,873 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:11,923 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2024-11-17 04:06:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:06:11,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 04:06:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:11,927 INFO L225 Difference]: With dead ends: 83 [2024-11-17 04:06:11,927 INFO L226 Difference]: Without dead ends: 82 [2024-11-17 04:06:11,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:06:11,928 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:11,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 250 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-17 04:06:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-17 04:06:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.352112676056338) internal successors, (96), 75 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2024-11-17 04:06:11,948 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 17 [2024-11-17 04:06:11,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:11,948 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2024-11-17 04:06:11,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2024-11-17 04:06:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 04:06:11,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:11,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:11,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 04:06:12,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:12,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:12,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash -429309393, now seen corresponding path program 1 times [2024-11-17 04:06:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743353974] [2024-11-17 04:06:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:12,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:12,237 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-17 04:06:12,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743353974] [2024-11-17 04:06:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743353974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:12,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:12,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 04:06:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74068219] [2024-11-17 04:06:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:12,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 04:06:12,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:12,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 04:06:12,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 04:06:12,241 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:12,250 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2024-11-17 04:06:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 04:06:12,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 04:06:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:12,252 INFO L225 Difference]: With dead ends: 80 [2024-11-17 04:06:12,252 INFO L226 Difference]: Without dead ends: 79 [2024-11-17 04:06:12,253 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-17 04:06:12,253 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 103 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-17 04:06:12,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-17 04:06:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2024-11-17 04:06:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 70 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2024-11-17 04:06:12,261 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 18 [2024-11-17 04:06:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2024-11-17 04:06:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2024-11-17 04:06:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 04:06:12,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:12,263 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:12,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:06:12,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:12,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash -124679165, now seen corresponding path program 1 times [2024-11-17 04:06:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:12,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003188318] [2024-11-17 04:06:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:12,348 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-17 04:06:12,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:12,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003188318] [2024-11-17 04:06:12,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003188318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872080956] [2024-11-17 04:06:12,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:12,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:12,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:12,351 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-17 04:06:12,352 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-17 04:06:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:12,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 04:06:12,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:12,509 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-17 04:06:12,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:06:12,555 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-17 04:06:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872080956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:06:12,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:06:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-17 04:06:12,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639232871] [2024-11-17 04:06:12,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:06:12,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 04:06:12,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 04:06:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:06:12,560 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:12,609 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2024-11-17 04:06:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 04:06:12,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 04:06:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:12,611 INFO L225 Difference]: With dead ends: 168 [2024-11-17 04:06:12,611 INFO L226 Difference]: Without dead ends: 95 [2024-11-17 04:06:12,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:06:12,613 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:12,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-17 04:06:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-17 04:06:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.264367816091954) internal successors, (110), 90 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2024-11-17 04:06:12,630 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 23 [2024-11-17 04:06:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:12,631 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2024-11-17 04:06:12,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2024-11-17 04:06:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 04:06:12,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:12,632 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:12,651 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-17 04:06:12,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:12,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:12,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:12,834 INFO L85 PathProgramCache]: Analyzing trace with hash 604240675, now seen corresponding path program 2 times [2024-11-17 04:06:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666040500] [2024-11-17 04:06:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 04:06:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666040500] [2024-11-17 04:06:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666040500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:06:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662792362] [2024-11-17 04:06:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:13,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:06:13,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:06:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:06:13,028 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:13,108 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2024-11-17 04:06:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:06:13,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-17 04:06:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:13,110 INFO L225 Difference]: With dead ends: 119 [2024-11-17 04:06:13,112 INFO L226 Difference]: Without dead ends: 118 [2024-11-17 04:06:13,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-17 04:06:13,113 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:13,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-17 04:06:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2024-11-17 04:06:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 99 states have (on average 1.292929292929293) internal successors, (128), 102 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2024-11-17 04:06:13,130 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 33 [2024-11-17 04:06:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:13,131 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2024-11-17 04:06:13,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2024-11-17 04:06:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 04:06:13,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:13,132 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:13,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 04:06:13,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1551591721, now seen corresponding path program 1 times [2024-11-17 04:06:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828668149] [2024-11-17 04:06:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 04:06:13,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828668149] [2024-11-17 04:06:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828668149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:13,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:06:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:06:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176052369] [2024-11-17 04:06:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:13,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:06:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:13,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:06:13,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:06:13,297 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:13,369 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2024-11-17 04:06:13,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:06:13,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-17 04:06:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:13,371 INFO L225 Difference]: With dead ends: 118 [2024-11-17 04:06:13,372 INFO L226 Difference]: Without dead ends: 117 [2024-11-17 04:06:13,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-17 04:06:13,373 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:13,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-17 04:06:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2024-11-17 04:06:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 104 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2024-11-17 04:06:13,385 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 34 [2024-11-17 04:06:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:13,385 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2024-11-17 04:06:13,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2024-11-17 04:06:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-17 04:06:13,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:13,387 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:13,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 04:06:13,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 854639519, now seen corresponding path program 1 times [2024-11-17 04:06:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978139418] [2024-11-17 04:06:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978139418] [2024-11-17 04:06:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978139418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73699183] [2024-11-17 04:06:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:13,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:13,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:13,580 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-17 04:06:13,602 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-17 04:06:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:13,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 04:06:13,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:13,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:06:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73699183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:06:13,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:06:13,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-17 04:06:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784928256] [2024-11-17 04:06:13,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:06:13,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 04:06:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 04:06:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-17 04:06:13,895 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:13,949 INFO L93 Difference]: Finished difference Result 256 states and 316 transitions. [2024-11-17 04:06:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 04:06:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-17 04:06:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:13,951 INFO L225 Difference]: With dead ends: 256 [2024-11-17 04:06:13,951 INFO L226 Difference]: Without dead ends: 149 [2024-11-17 04:06:13,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-17 04:06:13,953 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:13,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:06:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-17 04:06:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-17 04:06:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 141 states have (on average 1.2056737588652482) internal successors, (170), 144 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2024-11-17 04:06:13,967 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 35 [2024-11-17 04:06:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:13,967 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2024-11-17 04:06:13,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2024-11-17 04:06:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 04:06:13,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:13,969 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:13,987 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-17 04:06:14,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:14,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:14,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1429068255, now seen corresponding path program 2 times [2024-11-17 04:06:14,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:14,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449754238] [2024-11-17 04:06:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449754238] [2024-11-17 04:06:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449754238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315713488] [2024-11-17 04:06:14,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 04:06:14,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:14,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:14,503 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-17 04:06:14,505 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-17 04:06:14,642 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 04:06:14,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:06:14,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 04:06:14,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:14,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 04:06:14,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:14,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 04:06:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-17 04:06:14,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:06:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315713488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:06:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 20 [2024-11-17 04:06:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611392175] [2024-11-17 04:06:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:14,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:06:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:06:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-11-17 04:06:14,849 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:14,952 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2024-11-17 04:06:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:06:14,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-17 04:06:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:14,953 INFO L225 Difference]: With dead ends: 165 [2024-11-17 04:06:14,953 INFO L226 Difference]: Without dead ends: 164 [2024-11-17 04:06:14,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-17 04:06:14,954 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:14,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-17 04:06:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2024-11-17 04:06:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 147 states have (on average 1.2108843537414966) internal successors, (178), 150 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2024-11-17 04:06:14,967 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 55 [2024-11-17 04:06:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:14,967 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-11-17 04:06:14,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2024-11-17 04:06:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 04:06:14,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:14,969 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:14,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 04:06:15,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:15,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:15,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1351442917, now seen corresponding path program 1 times [2024-11-17 04:06:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:15,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245714445] [2024-11-17 04:06:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:15,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:15,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245714445] [2024-11-17 04:06:15,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245714445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:15,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565085126] [2024-11-17 04:06:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:15,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:15,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:15,505 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-17 04:06:15,507 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-17 04:06:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:15,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 04:06:15,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:15,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:06:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565085126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:06:16,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:06:16,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-17 04:06:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468990238] [2024-11-17 04:06:16,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:06:16,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-17 04:06:16,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-17 04:06:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 04:06:16,114 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:16,233 INFO L93 Difference]: Finished difference Result 388 states and 460 transitions. [2024-11-17 04:06:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-17 04:06:16,234 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-17 04:06:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:16,235 INFO L225 Difference]: With dead ends: 388 [2024-11-17 04:06:16,235 INFO L226 Difference]: Without dead ends: 235 [2024-11-17 04:06:16,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 04:06:16,237 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:16,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-17 04:06:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-17 04:06:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 227 states have (on average 1.1365638766519823) internal successors, (258), 230 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 262 transitions. [2024-11-17 04:06:16,255 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 262 transitions. Word has length 56 [2024-11-17 04:06:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:16,255 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 262 transitions. [2024-11-17 04:06:16,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 262 transitions. [2024-11-17 04:06:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 04:06:16,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:16,258 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:16,279 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-17 04:06:16,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-17 04:06:16,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:16,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1479124325, now seen corresponding path program 2 times [2024-11-17 04:06:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:16,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141262457] [2024-11-17 04:06:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:06:17,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141262457] [2024-11-17 04:06:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141262457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520218331] [2024-11-17 04:06:17,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 04:06:17,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:17,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:17,441 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-17 04:06:17,443 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-17 04:06:17,607 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 04:06:17,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:06:17,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 04:06:17,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:17,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 04:06:17,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 04:06:17,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 04:06:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-11-17 04:06:17,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:06:17,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520218331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:06:17,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:06:17,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-11-17 04:06:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235667460] [2024-11-17 04:06:17,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:06:17,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 04:06:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:17,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 04:06:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 04:06:17,844 INFO L87 Difference]: Start difference. First operand 235 states and 262 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:17,966 INFO L93 Difference]: Finished difference Result 244 states and 272 transitions. [2024-11-17 04:06:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 04:06:17,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-17 04:06:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:17,967 INFO L225 Difference]: With dead ends: 244 [2024-11-17 04:06:17,967 INFO L226 Difference]: Without dead ends: 243 [2024-11-17 04:06:17,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2024-11-17 04:06:17,969 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:17,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-17 04:06:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2024-11-17 04:06:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 229 states have (on average 1.1353711790393013) internal successors, (260), 232 states have internal predecessors, (260), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 264 transitions. [2024-11-17 04:06:17,977 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 264 transitions. Word has length 96 [2024-11-17 04:06:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:17,977 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 264 transitions. [2024-11-17 04:06:17,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 264 transitions. [2024-11-17 04:06:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 04:06:17,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:17,979 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:17,997 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-17 04:06:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:18,180 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:18,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1704353063, now seen corresponding path program 1 times [2024-11-17 04:06:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:18,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162369599] [2024-11-17 04:06:18,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 04:06:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:06:19,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162369599] [2024-11-17 04:06:19,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162369599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:06:19,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755451569] [2024-11-17 04:06:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:19,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:19,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:06:19,043 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-17 04:06:19,044 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-17 04:06:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:06:19,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-17 04:06:19,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:06:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 04:06:19,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:06:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 04:06:20,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755451569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:06:20,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:06:20,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2024-11-17 04:06:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480953092] [2024-11-17 04:06:20,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:06:20,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-17 04:06:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:06:20,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-17 04:06:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-11-17 04:06:20,089 INFO L87 Difference]: Start difference. First operand 237 states and 264 transitions. Second operand has 43 states, 43 states have (on average 2.86046511627907) internal successors, (123), 43 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:06:20,235 INFO L93 Difference]: Finished difference Result 522 states and 588 transitions. [2024-11-17 04:06:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-17 04:06:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.86046511627907) internal successors, (123), 43 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-17 04:06:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:06:20,237 INFO L225 Difference]: With dead ends: 522 [2024-11-17 04:06:20,237 INFO L226 Difference]: Without dead ends: 287 [2024-11-17 04:06:20,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 23 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-11-17 04:06:20,240 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:06:20,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:06:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-17 04:06:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-17 04:06:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 279 states have (on average 1.1111111111111112) internal successors, (310), 282 states have internal predecessors, (310), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:06:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2024-11-17 04:06:20,252 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 101 [2024-11-17 04:06:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:06:20,253 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2024-11-17 04:06:20,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.86046511627907) internal successors, (123), 43 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:06:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2024-11-17 04:06:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-17 04:06:20,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:06:20,255 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:06:20,273 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-17 04:06:20,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:06:20,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 04:06:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:06:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash -720823042, now seen corresponding path program 2 times [2024-11-17 04:06:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:06:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248446187] [2024-11-17 04:06:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:06:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:06:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 04:06:20,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 04:06:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 04:06:20,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 04:06:20,730 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 04:06:20,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 04:06:20,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 04:06:20,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 04:06:20,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 04:06:20,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 04:06:20,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 04:06:20,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 04:06:20,740 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-17 04:06:20,819 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 04:06:20,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:06:20 BoogieIcfgContainer [2024-11-17 04:06:20,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 04:06:20,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 04:06:20,823 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 04:06:20,823 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 04:06:20,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:06:10" (3/4) ... [2024-11-17 04:06:20,824 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 04:06:20,888 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 04:06:20,889 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 04:06:20,889 INFO L158 Benchmark]: Toolchain (without parser) took 11636.84ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 155.5MB in the beginning and 188.6MB in the end (delta: -33.1MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB. [2024-11-17 04:06:20,889 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 192.9MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 04:06:20,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.45ms. Allocated memory is still 192.9MB. Free memory was 155.3MB in the beginning and 144.8MB in the end (delta: 10.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 04:06:20,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.30ms. Allocated memory is still 192.9MB. Free memory was 143.8MB in the beginning and 142.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 04:06:20,890 INFO L158 Benchmark]: Boogie Preprocessor took 61.26ms. Allocated memory is still 192.9MB. Free memory was 142.7MB in the beginning and 138.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 04:06:20,890 INFO L158 Benchmark]: IcfgBuilder took 625.01ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 142.9MB in the end (delta: -4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 04:06:20,891 INFO L158 Benchmark]: TraceAbstraction took 10355.02ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 142.9MB in the beginning and 193.9MB in the end (delta: -51.0MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. [2024-11-17 04:06:20,891 INFO L158 Benchmark]: Witness Printer took 65.73ms. Allocated memory is still 343.9MB. Free memory was 193.9MB in the beginning and 188.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 04:06:20,892 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.96ms. Allocated memory is still 192.9MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.45ms. Allocated memory is still 192.9MB. Free memory was 155.3MB in the beginning and 144.8MB in the end (delta: 10.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.30ms. Allocated memory is still 192.9MB. Free memory was 143.8MB in the beginning and 142.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.26ms. Allocated memory is still 192.9MB. Free memory was 142.7MB in the beginning and 138.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 625.01ms. Allocated memory is still 192.9MB. Free memory was 138.5MB in the beginning and 142.9MB in the end (delta: -4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10355.02ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 142.9MB in the beginning and 193.9MB in the end (delta: -51.0MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. * Witness Printer took 65.73ms. Allocated memory is still 343.9MB. Free memory was 193.9MB in the beginning and 188.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 564]: integer overflow possible integer overflow possible We found a FailurePath: [L597] struct node_t *list = ((void *)0); [L597] struct node_t *list = ((void *)0); [L598] int dataNotFinished = 0; VAL [list={3:0}] [L600] CALL append(&list) [L587] struct node_t *node = malloc(sizeof *node); [L588] EXPR \read(**pointerToList) [L588] node->next = *pointerToList [L589] EXPR \read(**pointerToList) [L589] COND TRUE *pointerToList == ((void *)0) [L590] CALL create_data(((void *)0)) VAL [\old(prevData)={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\old(prevData)={0:0}, prevData={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\old(prevData)={0:0}, prevData={0:0}] [L552] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L555] Data data = malloc(sizeof *data); [L556] data->array = (int*) malloc(20 * sizeof(data->array)) [L557] int counter = 0; [L558] counter = 0 VAL [\old(prevData)={0:0}, counter=0, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=1, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=2, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=3, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=4, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=5, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=6, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=7, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=8, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=9, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=10, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=11, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=12, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=13, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=14, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=15, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=16, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=17, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=18, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=19, data={-3:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=20, data={-3:0}, prevData={0:0}] [L558] COND FALSE !(counter < 20) VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}] [L561] data->number = 0 [L562] int userInput = __VERIFIER_nondet_int(); [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L564] EXPR data->number [L564] EXPR data->number + __VERIFIER_nondet_int() VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}] [L564] data->number = data->number + __VERIFIER_nondet_int() [L565] userInput = __VERIFIER_nondet_int() [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}, userInput=0] [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L564] EXPR data->number [L564] data->number + __VERIFIER_nondet_int() VAL [\old(prevData)={0:0}, data={-3:0}, prevData={0:0}] - UnprovableResult [Line: 570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 13, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 2763 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2165 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 476 IncrementalHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 598 mSDtfsCounter, 476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 726 GetRequests, 534 SyntacticMatches, 23 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=12, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 47 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1006 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 2635 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1868 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 744/3512 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-17 04:06:20,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)