./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 20:22:33,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:22:33,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:22:33,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:22:33,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:22:33,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:22:33,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:22:33,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:22:33,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:22:33,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:22:33,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:22:33,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:22:33,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:22:33,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:22:33,205 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:22:33,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:22:33,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:22:33,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:22:33,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:22:33,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:22:33,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:22:33,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:22:33,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:22:33,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:22:33,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:22:33,209 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:22:33,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:22:33,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:22:33,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:22:33,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:22:33,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:22:33,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:22:33,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:22:33,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:22:33,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:22:33,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:22:33,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:22:33,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:22:33,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:22:33,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:22:33,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:22:33,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:22:33,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:22:33,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:22:33,215 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-clean/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-clean/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-10-11 20:22:33,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:22:33,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:22:33,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:22:33,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:22:33,536 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:22:33,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2024-10-11 20:22:35,038 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:22:35,278 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:22:35,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2024-10-11 20:22:35,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f25218cb3/c8cb9661e09243178bab80408c0d4c8c/FLAGaad4aedc6 [2024-10-11 20:22:35,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f25218cb3/c8cb9661e09243178bab80408c0d4c8c [2024-10-11 20:22:35,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:22:35,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:22:35,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:22:35,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:22:35,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:22:35,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3070fd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35, skipping insertion in model container [2024-10-11 20:22:35,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:22:35,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:22:35,741 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:22:35,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:22:35,822 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:22:35,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35 WrapperNode [2024-10-11 20:22:35,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:22:35,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:22:35,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:22:35,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:22:35,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,927 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-10-11 20:22:35,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:22:35,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:22:35,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:22:35,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:22:35,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,971 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-10-11 20:22:35,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:35,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:22:35,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:22:35,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:22:35,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:22:35,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (1/1) ... [2024-10-11 20:22:36,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:22:36,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:36,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:22:36,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:22:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:22:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:22:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:22:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:22:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:22:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-10-11 20:22:36,085 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 20:22:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:22:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:22:36,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:22:36,242 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:22:36,244 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:22:36,615 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-11 20:22:36,618 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:22:36,657 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:22:36,658 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 20:22:36,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:36 BoogieIcfgContainer [2024-10-11 20:22:36,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:22:36,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:22:36,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:22:36,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:22:36,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:22:35" (1/3) ... [2024-10-11 20:22:36,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201e3941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:22:36, skipping insertion in model container [2024-10-11 20:22:36,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:35" (2/3) ... [2024-10-11 20:22:36,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201e3941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:22:36, skipping insertion in model container [2024-10-11 20:22:36,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:36" (3/3) ... [2024-10-11 20:22:36,666 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2024-10-11 20:22:36,683 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:22:36,684 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 20:22:36,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:22:36,736 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;@32826109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:22:36,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 20:22:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 39 states have internal predecessors, (55), 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-10-11 20:22:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:22:36,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:36,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:36,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:36,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1143193573, now seen corresponding path program 1 times [2024-10-11 20:22:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767404009] [2024-10-11 20:22:36,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767404009] [2024-10-11 20:22:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767404009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:37,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:37,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:22:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272622735] [2024-10-11 20:22:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:37,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:37,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:37,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:22:37,202 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 39 states have internal predecessors, (55), 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, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-11 20:22:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:37,322 INFO L93 Difference]: Finished difference Result 113 states and 156 transitions. [2024-10-11 20:22:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:37,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-10-11 20:22:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:37,332 INFO L225 Difference]: With dead ends: 113 [2024-10-11 20:22:37,332 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 20:22:37,335 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-10-11 20:22:37,337 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 32 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:37,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 20:22:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-10-11 20:22:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 56 states have internal predecessors, (78), 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-10-11 20:22:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2024-10-11 20:22:37,374 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 9 [2024-10-11 20:22:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:37,375 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2024-10-11 20:22:37,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-10-11 20:22:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2024-10-11 20:22:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:22:37,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:37,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:37,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:22:37,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1143133991, now seen corresponding path program 1 times [2024-10-11 20:22:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:37,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014079459] [2024-10-11 20:22:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:37,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:37,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014079459] [2024-10-11 20:22:37,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014079459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:37,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:22:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129694235] [2024-10-11 20:22:37,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:37,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:37,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:37,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:22:37,582 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10-11 20:22:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:37,640 INFO L93 Difference]: Finished difference Result 127 states and 177 transitions. [2024-10-11 20:22:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:37,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-11 20:22:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:37,643 INFO L225 Difference]: With dead ends: 127 [2024-10-11 20:22:37,643 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 20:22:37,644 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-10-11 20:22:37,647 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:37,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 128 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 20:22:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 20:22:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 62 states have internal predecessors, (84), 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-10-11 20:22:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2024-10-11 20:22:37,660 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 9 [2024-10-11 20:22:37,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:37,661 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2024-10-11 20:22:37,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10-11 20:22:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2024-10-11 20:22:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:22:37,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:37,665 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:37,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:22:37,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:37,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash -308978774, now seen corresponding path program 1 times [2024-10-11 20:22:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:37,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625858932] [2024-10-11 20:22:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625858932] [2024-10-11 20:22:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625858932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541508919] [2024-10-11 20:22:37,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:37,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:37,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:37,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:37,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:22:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:37,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:22:37,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:38,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541508919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:22:38,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190737334] [2024-10-11 20:22:38,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:38,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:22:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:38,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:22:38,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:22:38,048 INFO L87 Difference]: Start difference. First operand 67 states and 88 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-10-11 20:22:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:38,103 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-10-11 20:22:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:22:38,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-10-11 20:22:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:38,105 INFO L225 Difference]: With dead ends: 67 [2024-10-11 20:22:38,105 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 20:22:38,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-10-11 20:22:38,106 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:38,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 20:22:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 20:22:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 61 states have internal predecessors, (82), 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-10-11 20:22:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2024-10-11 20:22:38,115 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 12 [2024-10-11 20:22:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:38,115 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-10-11 20:22:38,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-10-11 20:22:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2024-10-11 20:22:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:22:38,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:38,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:38,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:22:38,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:38,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:38,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash -988407348, now seen corresponding path program 1 times [2024-10-11 20:22:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:38,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768733801] [2024-10-11 20:22:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:22:38,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768733801] [2024-10-11 20:22:38,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768733801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:22:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694156409] [2024-10-11 20:22:38,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:38,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:22:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:38,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:22:38,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:22:38,426 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 20:22:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:38,446 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-10-11 20:22:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:22:38,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-10-11 20:22:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:38,448 INFO L225 Difference]: With dead ends: 66 [2024-10-11 20:22:38,450 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 20:22:38,450 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-10-11 20:22:38,451 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:38,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 20:22:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-10-11 20:22:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 56 states have internal predecessors, (76), 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-10-11 20:22:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-10-11 20:22:38,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 13 [2024-10-11 20:22:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:38,467 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-10-11 20:22:38,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 20:22:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-10-11 20:22:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:22:38,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:38,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:38,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:22:38,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:38,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 889450193, now seen corresponding path program 1 times [2024-10-11 20:22:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:38,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216988778] [2024-10-11 20:22:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:38,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216988778] [2024-10-11 20:22:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216988778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111097356] [2024-10-11 20:22:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:38,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:38,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:38,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:22:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:38,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:22:38,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:38,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111097356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:38,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:38,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 20:22:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471481026] [2024-10-11 20:22:38,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:38,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:22:38,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:22:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:22:38,831 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-10-11 20:22:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:38,878 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2024-10-11 20:22:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:22:38,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-10-11 20:22:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:38,883 INFO L225 Difference]: With dead ends: 133 [2024-10-11 20:22:38,883 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 20:22:38,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 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-10-11 20:22:38,885 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:38,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 20:22:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 20:22:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.353846153846154) internal successors, (88), 68 states have internal predecessors, (88), 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-10-11 20:22:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2024-10-11 20:22:38,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 18 [2024-10-11 20:22:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:38,898 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2024-10-11 20:22:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-10-11 20:22:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2024-10-11 20:22:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:22:38,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:38,901 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:38,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:22:39,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:39,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:39,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -397485967, now seen corresponding path program 2 times [2024-10-11 20:22:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809495228] [2024-10-11 20:22:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:39,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:39,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809495228] [2024-10-11 20:22:39,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809495228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408531411] [2024-10-11 20:22:39,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:22:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:39,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:39,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:39,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:22:39,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:22:39,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:22:39,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:22:39,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:39,462 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-10-11 20:22:39,503 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-10-11 20:22:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:22:39,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408531411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:39,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-10-11 20:22:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900689251] [2024-10-11 20:22:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:39,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:39,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:22:39,524 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-10-11 20:22:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:39,668 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2024-10-11 20:22:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 24 [2024-10-11 20:22:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:39,669 INFO L225 Difference]: With dead ends: 95 [2024-10-11 20:22:39,669 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 20:22:39,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:22:39,670 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:39,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 98 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 20:22:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-10-11 20:22:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 80 states have internal predecessors, (106), 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-10-11 20:22:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2024-10-11 20:22:39,685 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 24 [2024-10-11 20:22:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:39,686 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2024-10-11 20:22:39,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-10-11 20:22:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2024-10-11 20:22:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:22:39,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:39,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:39,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:22:39,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:39,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:39,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash 562836996, now seen corresponding path program 1 times [2024-10-11 20:22:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:39,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70065572] [2024-10-11 20:22:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:40,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:40,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70065572] [2024-10-11 20:22:40,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70065572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:40,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688323904] [2024-10-11 20:22:40,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:40,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:40,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:40,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:40,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:22:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:40,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:22:40,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:40,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688323904] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:40,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-11 20:22:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281641038] [2024-10-11 20:22:40,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:40,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:22:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:40,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:22:40,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:22:40,355 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 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-10-11 20:22:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:40,424 INFO L93 Difference]: Finished difference Result 193 states and 253 transitions. [2024-10-11 20:22:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:22:40,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 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 25 [2024-10-11 20:22:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:40,426 INFO L225 Difference]: With dead ends: 193 [2024-10-11 20:22:40,426 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 20:22:40,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 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-10-11 20:22:40,429 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:40,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 20:22:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 20:22:40,440 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-10-11 20:22:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2024-10-11 20:22:40,441 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 25 [2024-10-11 20:22:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:40,442 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2024-10-11 20:22:40,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 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-10-11 20:22:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2024-10-11 20:22:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:22:40,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:40,443 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:40,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:22:40,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 20:22:40,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:40,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1638593220, now seen corresponding path program 2 times [2024-10-11 20:22:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:40,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076893141] [2024-10-11 20:22:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076893141] [2024-10-11 20:22:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076893141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981224769] [2024-10-11 20:22:40,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:22:40,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:40,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:40,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:22:41,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:22:41,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:22:41,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:22:41,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:41,133 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-10-11 20:22:41,163 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-10-11 20:22:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-11 20:22:41,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981224769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:41,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:41,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 19 [2024-10-11 20:22:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296057978] [2024-10-11 20:22:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:41,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:41,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:41,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:22:41,195 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 20:22:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:41,281 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2024-10-11 20:22:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 37 [2024-10-11 20:22:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:41,283 INFO L225 Difference]: With dead ends: 118 [2024-10-11 20:22:41,283 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 20:22:41,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:22:41,284 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:41,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 20:22:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2024-10-11 20:22:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.2815533980582525) internal successors, (132), 106 states have internal predecessors, (132), 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-10-11 20:22:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2024-10-11 20:22:41,292 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 37 [2024-10-11 20:22:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:41,293 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-10-11 20:22:41,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 20:22:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2024-10-11 20:22:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:22:41,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:41,294 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:41,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:22:41,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:41,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:41,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -743271237, now seen corresponding path program 1 times [2024-10-11 20:22:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677868687] [2024-10-11 20:22:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:41,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:41,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677868687] [2024-10-11 20:22:41,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677868687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848408573] [2024-10-11 20:22:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:41,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:41,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:22:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:42,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 20:22:42,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:42,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848408573] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:42,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:42,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-10-11 20:22:42,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256663001] [2024-10-11 20:22:42,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:42,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 20:22:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 20:22:42,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 20:22:42,441 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 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-10-11 20:22:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:42,556 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2024-10-11 20:22:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 20:22:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 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 38 [2024-10-11 20:22:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:42,558 INFO L225 Difference]: With dead ends: 269 [2024-10-11 20:22:42,558 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 20:22:42,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 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-10-11 20:22:42,559 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:42,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 20:22:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-10-11 20:22:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 151 states have (on average 1.1920529801324504) internal successors, (180), 154 states have internal predecessors, (180), 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-10-11 20:22:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2024-10-11 20:22:42,572 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 38 [2024-10-11 20:22:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:42,572 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2024-10-11 20:22:42,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 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-10-11 20:22:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2024-10-11 20:22:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 20:22:42,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:42,574 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:42,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:22:42,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 20:22:42,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:42,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash -194532549, now seen corresponding path program 2 times [2024-10-11 20:22:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382961790] [2024-10-11 20:22:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:43,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382961790] [2024-10-11 20:22:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382961790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:43,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151087346] [2024-10-11 20:22:43,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:22:43,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:43,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:43,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:43,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:22:43,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:22:43,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:22:43,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 20:22:43,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:43,965 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 20:22:43,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2024-10-11 20:22:44,068 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-10-11 20:22:44,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 20:22:44,147 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-10-11 20:22:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-11 20:22:44,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151087346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-10-11 20:22:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116627686] [2024-10-11 20:22:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:44,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:44,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 20:22:44,177 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-10-11 20:22:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:44,307 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2024-10-11 20:22:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:44,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 62 [2024-10-11 20:22:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:44,308 INFO L225 Difference]: With dead ends: 171 [2024-10-11 20:22:44,308 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 20:22:44,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 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-10-11 20:22:44,310 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:44,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 98 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 20:22:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2024-10-11 20:22:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 157 states have (on average 1.197452229299363) internal successors, (188), 160 states have internal predecessors, (188), 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-10-11 20:22:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2024-10-11 20:22:44,319 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 62 [2024-10-11 20:22:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:44,319 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2024-10-11 20:22:44,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-10-11 20:22:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2024-10-11 20:22:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 20:22:44,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:44,321 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:44,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:22:44,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:44,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:44,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1735541627, now seen corresponding path program 1 times [2024-10-11 20:22:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:44,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758352045] [2024-10-11 20:22:44,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:45,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:45,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758352045] [2024-10-11 20:22:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758352045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490071747] [2024-10-11 20:22:45,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:45,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:45,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:45,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:45,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:22:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:45,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 20:22:45,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:45,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:46,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490071747] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:46,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:46,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2024-10-11 20:22:46,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844639949] [2024-10-11 20:22:46,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:46,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 20:22:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:46,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 20:22:46,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 20:22:46,374 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 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-10-11 20:22:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:46,503 INFO L93 Difference]: Finished difference Result 359 states and 425 transitions. [2024-10-11 20:22:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 20:22:46,505 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 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 63 [2024-10-11 20:22:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:46,506 INFO L225 Difference]: With dead ends: 359 [2024-10-11 20:22:46,506 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 20:22:46,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 93 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-10-11 20:22:46,508 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:46,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 492 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 20:22:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-11 20:22:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 187 states have (on average 1.1657754010695187) internal successors, (218), 190 states have internal predecessors, (218), 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-10-11 20:22:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2024-10-11 20:22:46,516 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 63 [2024-10-11 20:22:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:46,516 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2024-10-11 20:22:46,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 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-10-11 20:22:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2024-10-11 20:22:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 20:22:46,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:46,519 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:46,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:22:46,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:22:46,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:46,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1599251414, now seen corresponding path program 2 times [2024-10-11 20:22:46,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:46,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125756849] [2024-10-11 20:22:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-10-11 20:22:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125756849] [2024-10-11 20:22:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125756849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:47,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:47,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:22:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111491032] [2024-10-11 20:22:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:47,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:47,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:47,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:47,435 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-10-11 20:22:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:47,524 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2024-10-11 20:22:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:47,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 78 [2024-10-11 20:22:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:47,526 INFO L225 Difference]: With dead ends: 200 [2024-10-11 20:22:47,526 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 20:22:47,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:22:47,526 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:47,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 20:22:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2024-10-11 20:22:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 1.164021164021164) internal successors, (220), 192 states have internal predecessors, (220), 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-10-11 20:22:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2024-10-11 20:22:47,534 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 78 [2024-10-11 20:22:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:47,534 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2024-10-11 20:22:47,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-10-11 20:22:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2024-10-11 20:22:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 20:22:47,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:47,535 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:47,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:22:47,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:22:47,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2073750685, now seen corresponding path program 1 times [2024-10-11 20:22:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:47,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293057976] [2024-10-11 20:22:47,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:22:47,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 20:22:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:22:47,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 20:22:47,756 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 20:22:47,757 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 20:22:47,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 20:22:47,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 20:22:47,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 20:22:47,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 20:22:47,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 20:22:47,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:22:47,763 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:22:47,831 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:22:47,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:22:47 BoogieIcfgContainer [2024-10-11 20:22:47,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:22:47,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:22:47,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:22:47,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:22:47,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:36" (3/4) ... [2024-10-11 20:22:47,837 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 20:22:47,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:22:47,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:22:47,909 INFO L158 Benchmark]: Toolchain (without parser) took 12592.82ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 96.4MB in the beginning and 102.3MB in the end (delta: -5.9MB). Peak memory consumption was 139.4MB. Max. memory is 16.1GB. [2024-10-11 20:22:47,909 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:22:47,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.22ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 138.3MB in the end (delta: -41.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-10-11 20:22:47,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.16ms. Allocated memory is still 167.8MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:22:47,910 INFO L158 Benchmark]: Boogie Preprocessor took 60.91ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 133.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:22:47,911 INFO L158 Benchmark]: RCFGBuilder took 667.15ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 106.9MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 20:22:47,911 INFO L158 Benchmark]: TraceAbstraction took 11174.06ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 106.9MB in the beginning and 107.6MB in the end (delta: -695.6kB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. [2024-10-11 20:22:47,911 INFO L158 Benchmark]: Witness Printer took 73.22ms. Allocated memory is still 310.4MB. Free memory was 107.6MB in the beginning and 102.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:22:47,913 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.22ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 138.3MB in the end (delta: -41.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.16ms. Allocated memory is still 167.8MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.91ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 133.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 667.15ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 106.9MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11174.06ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 106.9MB in the beginning and 107.6MB in the end (delta: -695.6kB). Peak memory consumption was 144.9MB. Max. memory is 16.1GB. * Witness Printer took 73.22ms. Allocated memory is still 310.4MB. Free memory was 107.6MB in the beginning and 102.3MB 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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4: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={-4:0}, prevData={0:0}] [L558] COND FALSE !(counter < 20) VAL [\old(prevData)={0:0}, data={-4: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={-4: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={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-4: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={-4: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() [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={-4: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={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={0:0}, data={-4: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={-4: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={-4:0}, prevData={0:0}] - 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 2179 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1700 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 570 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 479 mSDtfsCounter, 570 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 358 SyntacticMatches, 23 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 749 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 2160 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1926 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 1007/2660 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-10-11 20:22:47,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)