./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', 'dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 22:14:30,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 22:14:30,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 22:14:30,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 22:14:30,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 22:14:30,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 22:14:30,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 22:14:30,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 22:14:30,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 22:14:30,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 22:14:30,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 22:14:30,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 22:14:30,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 22:14:30,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 22:14:30,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 22:14:30,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:14:30,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 22:14:30,245 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 [2024-11-07 22:14:30,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 22:14:30,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 22:14:30,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 22:14:30,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 22:14:30,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 22:14:30,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-07 22:14:31,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 22:14:32,062 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 22:14:32,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-07 22:14:32,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0df4ea70c/dc488de6ca4541a7844469e98d313cd8/FLAGc887648c1 [2024-11-07 22:14:32,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0df4ea70c/dc488de6ca4541a7844469e98d313cd8 [2024-11-07 22:14:32,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 22:14:32,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 22:14:32,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 22:14:32,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 22:14:32,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 22:14:32,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:14:32" (1/1) ... [2024-11-07 22:14:32,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6a06bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:32, skipping insertion in model container [2024-11-07 22:14:32,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:14:32" (1/1) ... [2024-11-07 22:14:32,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 22:14:32,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:14:32,869 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 22:14:32,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:14:33,098 INFO L204 MainTranslator]: Completed translation [2024-11-07 22:14:33,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33 WrapperNode [2024-11-07 22:14:33,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 22:14:33,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 22:14:33,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 22:14:33,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 22:14:33,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,139 INFO L138 Inliner]: procedures = 497, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2024-11-07 22:14:33,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 22:14:33,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 22:14:33,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 22:14:33,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 22:14:33,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,152 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 22:14:33,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 22:14:33,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 22:14:33,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 22:14:33,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 22:14:33,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (1/1) ... [2024-11-07 22:14:33,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:14:33,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:14:33,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 22:14:33,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 22:14:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-07 22:14:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-07 22:14:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-07 22:14:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-07 22:14:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 22:14:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 22:14:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 22:14:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 22:14:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 22:14:33,330 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 22:14:33,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 22:14:33,560 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-07 22:14:33,560 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 22:14:33,569 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 22:14:33,570 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 22:14:33,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:33 BoogieIcfgContainer [2024-11-07 22:14:33,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 22:14:33,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 22:14:33,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 22:14:33,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 22:14:33,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:14:32" (1/3) ... [2024-11-07 22:14:33,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e726d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:33, skipping insertion in model container [2024-11-07 22:14:33,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:33" (2/3) ... [2024-11-07 22:14:33,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e726d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:33, skipping insertion in model container [2024-11-07 22:14:33,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:33" (3/3) ... [2024-11-07 22:14:33,578 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-07 22:14:33,587 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 22:14:33,588 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 22:14:33,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 22:14:33,643 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;@14836a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 22:14:33,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 22:14:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 52 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 22:14:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 22:14:33,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:33,651 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:33,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:33,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash 410761618, now seen corresponding path program 1 times [2024-11-07 22:14:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:14:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401631033] [2024-11-07 22:14:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:14:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:14:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 22:14:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 22:14:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:14:33,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:14:33,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401631033] [2024-11-07 22:14:33,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401631033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:14:33,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:14:33,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:14:33,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223806646] [2024-11-07 22:14:33,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:14:33,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:14:33,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:14:33,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:14:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:33,965 INFO L87 Difference]: Start difference. First operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 52 states have internal predecessors, (69), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:14:34,011 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2024-11-07 22:14:34,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:14:34,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-07 22:14:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:14:34,016 INFO L225 Difference]: With dead ends: 83 [2024-11-07 22:14:34,017 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 22:14:34,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:34,021 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:14:34,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:14:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 22:14:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-07 22:14:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 44 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 22:14:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-07 22:14:34,051 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 21 [2024-11-07 22:14:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:14:34,053 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-07 22:14:34,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-07 22:14:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 22:14:34,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:34,055 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:34,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 22:14:34,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -151283612, now seen corresponding path program 1 times [2024-11-07 22:14:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:14:34,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422200731] [2024-11-07 22:14:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:14:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:14:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 22:14:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 22:14:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:14:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:14:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422200731] [2024-11-07 22:14:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422200731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:14:34,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:14:34,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:14:34,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89727137] [2024-11-07 22:14:34,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:14:34,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:14:34,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:14:34,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:14:34,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:34,207 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:14:34,232 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-11-07 22:14:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:14:34,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-07 22:14:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:14:34,233 INFO L225 Difference]: With dead ends: 56 [2024-11-07 22:14:34,234 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 22:14:34,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:34,235 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:14:34,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:14:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 22:14:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 22:14:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.435897435897436) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 22:14:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-11-07 22:14:34,239 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 22 [2024-11-07 22:14:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:14:34,241 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-11-07 22:14:34,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-11-07 22:14:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 22:14:34,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:34,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:34,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 22:14:34,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:34,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash 859877077, now seen corresponding path program 1 times [2024-11-07 22:14:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:14:34,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635137239] [2024-11-07 22:14:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:14:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:14:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 22:14:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 22:14:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:14:34,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:14:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635137239] [2024-11-07 22:14:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635137239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:14:34,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:14:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:14:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965576227] [2024-11-07 22:14:34,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:14:34,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:14:34,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:14:34,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:14:34,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:34,406 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:34,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:14:34,422 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2024-11-07 22:14:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:14:34,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-07 22:14:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:14:34,424 INFO L225 Difference]: With dead ends: 48 [2024-11-07 22:14:34,424 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 22:14:34,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:34,425 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:14:34,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:14:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 22:14:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 22:14:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 22:14:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-11-07 22:14:34,432 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 27 [2024-11-07 22:14:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:14:34,432 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-11-07 22:14:34,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-11-07 22:14:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 22:14:34,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:34,433 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:34,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 22:14:34,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:34,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 886393729, now seen corresponding path program 1 times [2024-11-07 22:14:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:14:34,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095233689] [2024-11-07 22:14:34,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:14:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 22:14:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 22:14:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 22:14:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:14:34,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 22:14:34,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095233689] [2024-11-07 22:14:34,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095233689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:14:34,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:14:34,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:14:34,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492090658] [2024-11-07 22:14:34,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:14:34,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:14:34,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 22:14:34,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:14:34,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:34,562 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:14:34,578 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-11-07 22:14:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:14:34,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-07 22:14:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:14:34,579 INFO L225 Difference]: With dead ends: 47 [2024-11-07 22:14:34,579 INFO L226 Difference]: Without dead ends: 46 [2024-11-07 22:14:34,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:34,579 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:14:34,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:14:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-07 22:14:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-07 22:14:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 22:14:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2024-11-07 22:14:34,586 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 28 [2024-11-07 22:14:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:14:34,586 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2024-11-07 22:14:34,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2024-11-07 22:14:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 22:14:34,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:34,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:34,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 22:14:34,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:34,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash 886385753, now seen corresponding path program 1 times [2024-11-07 22:14:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 22:14:34,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971599327] [2024-11-07 22:14:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 22:14:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:14:34,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 22:14:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:14:34,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 22:14:34,637 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 22:14:34,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 22:14:34,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 22:14:34,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 22:14:34,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 22:14:34,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 22:14:34,644 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 22:14:34,673 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 22:14:34,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:14:34 BoogieIcfgContainer [2024-11-07 22:14:34,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 22:14:34,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 22:14:34,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 22:14:34,677 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 22:14:34,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:33" (3/4) ... [2024-11-07 22:14:34,679 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 22:14:34,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 22:14:34,680 INFO L158 Benchmark]: Toolchain (without parser) took 2338.98ms. Allocated memory is still 100.7MB. Free memory was 73.4MB in the beginning and 43.6MB in the end (delta: 29.8MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-11-07 22:14:34,682 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:14:34,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.55ms. Allocated memory is still 100.7MB. Free memory was 73.2MB in the beginning and 47.6MB in the end (delta: 25.6MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-11-07 22:14:34,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.21ms. Allocated memory is still 100.7MB. Free memory was 47.6MB in the beginning and 44.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 22:14:34,683 INFO L158 Benchmark]: Boogie Preprocessor took 22.54ms. Allocated memory is still 100.7MB. Free memory was 44.9MB in the beginning and 43.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:14:34,683 INFO L158 Benchmark]: RCFGBuilder took 407.97ms. Allocated memory is still 100.7MB. Free memory was 43.1MB in the beginning and 68.6MB in the end (delta: -25.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-07 22:14:34,683 INFO L158 Benchmark]: TraceAbstraction took 1104.51ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 43.6MB in the end (delta: 24.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-07 22:14:34,683 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 100.7MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 12.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:14:34,684 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.55ms. Allocated memory is still 100.7MB. Free memory was 73.2MB in the beginning and 47.6MB in the end (delta: 25.6MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.21ms. Allocated memory is still 100.7MB. Free memory was 47.6MB in the beginning and 44.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.54ms. Allocated memory is still 100.7MB. Free memory was 44.9MB in the beginning and 43.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 407.97ms. Allocated memory is still 100.7MB. Free memory was 43.1MB in the beginning and 68.6MB in the end (delta: -25.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1104.51ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 43.6MB in the end (delta: 24.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 100.7MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 12.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1585. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1586] CALL CWE190_Integer_Overflow__int_rand_postinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: 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 4 procedures, 63 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 482 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 253 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 22:14:34,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 22:14:37,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 22:14:37,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-07 22:14:37,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 22:14:37,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 22:14:37,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-07 22:14:37,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 22:14:37,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 22:14:37,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 22:14:37,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 22:14:37,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 22:14:37,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 22:14:37,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 22:14:37,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 22:14:37,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 22:14:37,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 22:14:37,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 22:14:37,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 22:14:37,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 22:14:37,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 22:14:37,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:14:37,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 22:14:37,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc871371b7eb8945d46d164766cb79863f9bb5635a141197f34c58e079caf6b0 [2024-11-07 22:14:37,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 22:14:37,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 22:14:37,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 22:14:37,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 22:14:37,933 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 22:14:37,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-07 22:14:39,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 22:14:39,486 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 22:14:39,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-07 22:14:39,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f54535ab7/bffc539f52884fcb95af9e60d014cf75/FLAGe3ca71c29 [2024-11-07 22:14:39,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f54535ab7/bffc539f52884fcb95af9e60d014cf75 [2024-11-07 22:14:39,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 22:14:39,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 22:14:39,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 22:14:39,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 22:14:39,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 22:14:39,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:14:39" (1/1) ... [2024-11-07 22:14:39,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ba7a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:39, skipping insertion in model container [2024-11-07 22:14:39,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:14:39" (1/1) ... [2024-11-07 22:14:39,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 22:14:40,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:14:40,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 22:14:40,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 22:14:40,328 INFO L204 MainTranslator]: Completed translation [2024-11-07 22:14:40,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40 WrapperNode [2024-11-07 22:14:40,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 22:14:40,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 22:14:40,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 22:14:40,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 22:14:40,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,371 INFO L138 Inliner]: procedures = 502, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-07 22:14:40,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 22:14:40,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 22:14:40,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 22:14:40,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 22:14:40,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,396 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 22:14:40,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 22:14:40,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 22:14:40,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 22:14:40,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 22:14:40,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (1/1) ... [2024-11-07 22:14:40,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 22:14:40,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 22:14:40,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 22:14:40,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 22:14:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-07 22:14:40,467 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-07 22:14:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-07 22:14:40,467 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-07 22:14:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-07 22:14:40,467 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-07 22:14:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 22:14:40,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 22:14:40,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 22:14:40,594 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 22:14:40,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 22:14:40,723 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-07 22:14:40,723 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 22:14:40,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 22:14:40,730 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 22:14:40,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:40 BoogieIcfgContainer [2024-11-07 22:14:40,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 22:14:40,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 22:14:40,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 22:14:40,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 22:14:40,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:14:39" (1/3) ... [2024-11-07 22:14:40,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478b9215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:40, skipping insertion in model container [2024-11-07 22:14:40,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:40" (2/3) ... [2024-11-07 22:14:40,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478b9215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:40, skipping insertion in model container [2024-11-07 22:14:40,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:40" (3/3) ... [2024-11-07 22:14:40,737 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_12_bad.i [2024-11-07 22:14:40,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 22:14:40,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 22:14:40,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 22:14:40,801 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;@1309acd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 22:14:40,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 22:14:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 22:14:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 22:14:40,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:40,809 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:40,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:40,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1536608006, now seen corresponding path program 1 times [2024-11-07 22:14:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:14:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115375638] [2024-11-07 22:14:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:40,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:14:40,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:14:40,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:14:40,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 22:14:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:40,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 22:14:40,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:14:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:14:40,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:14:40,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:14:40,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115375638] [2024-11-07 22:14:40,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115375638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:14:40,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:14:40,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 22:14:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497257877] [2024-11-07 22:14:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:14:40,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 22:14:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:14:40,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 22:14:40,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 22:14:40,968 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 22:14:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:14:40,981 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-07 22:14:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 22:14:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2024-11-07 22:14:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:14:40,987 INFO L225 Difference]: With dead ends: 41 [2024-11-07 22:14:40,987 INFO L226 Difference]: Without dead ends: 24 [2024-11-07 22:14:40,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 22:14:40,993 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:14:40,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:14:41,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-07 22:14:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-07 22:14:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 22:14:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-07 22:14:41,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 19 [2024-11-07 22:14:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:14:41,021 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-07 22:14:41,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 22:14:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-07 22:14:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 22:14:41,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:41,022 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:41,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 22:14:41,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:14:41,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:41,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash 390207998, now seen corresponding path program 1 times [2024-11-07 22:14:41,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:14:41,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395324298] [2024-11-07 22:14:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:41,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:14:41,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:14:41,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:14:41,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 22:14:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:41,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 22:14:41,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:14:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:14:41,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:14:41,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:14:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395324298] [2024-11-07 22:14:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395324298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:14:41,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:14:41,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:14:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066910359] [2024-11-07 22:14:41,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:14:41,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:14:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:14:41,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:14:41,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:41,346 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:14:41,366 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-07 22:14:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:14:41,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-07 22:14:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:14:41,367 INFO L225 Difference]: With dead ends: 30 [2024-11-07 22:14:41,367 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 22:14:41,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:41,368 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:14:41,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:14:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 22:14:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-07 22:14:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 22:14:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-07 22:14:41,376 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2024-11-07 22:14:41,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:14:41,377 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-07 22:14:41,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-07 22:14:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 22:14:41,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:41,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:41,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 22:14:41,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:14:41,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:41,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash -788206615, now seen corresponding path program 1 times [2024-11-07 22:14:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:14:41,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87368906] [2024-11-07 22:14:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:41,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:14:41,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:14:41,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:14:41,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 22:14:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 22:14:41,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 22:14:41,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 22:14:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 22:14:41,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 22:14:41,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 22:14:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87368906] [2024-11-07 22:14:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87368906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 22:14:41,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 22:14:41,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 22:14:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084804471] [2024-11-07 22:14:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 22:14:41,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 22:14:41,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 22:14:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 22:14:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:41,678 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 22:14:41,692 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-07 22:14:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 22:14:41,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-07 22:14:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 22:14:41,693 INFO L225 Difference]: With dead ends: 30 [2024-11-07 22:14:41,694 INFO L226 Difference]: Without dead ends: 24 [2024-11-07 22:14:41,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 22:14:41,694 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 22:14:41,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 22:14:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-07 22:14:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-07 22:14:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 22:14:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-07 22:14:41,697 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2024-11-07 22:14:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 22:14:41,697 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-07 22:14:41,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 22:14:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-07 22:14:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 22:14:41,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 22:14:41,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 22:14:41,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 22:14:41,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:14:41,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 22:14:41,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 22:14:41,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2030650941, now seen corresponding path program 1 times [2024-11-07 22:14:41,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 22:14:41,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518467270] [2024-11-07 22:14:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 22:14:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:14:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 22:14:41,903 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 22:14:41,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 22:14:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:14:41,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 22:14:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 22:14:41,995 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 22:14:41,996 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 22:14:41,996 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 22:14:41,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 22:14:41,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 22:14:41,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 22:14:42,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 22:14:42,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 22:14:42,204 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 22:14:42,218 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 22:14:42,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:14:42 BoogieIcfgContainer [2024-11-07 22:14:42,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 22:14:42,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 22:14:42,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 22:14:42,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 22:14:42,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:40" (3/4) ... [2024-11-07 22:14:42,223 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 22:14:42,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 22:14:42,224 INFO L158 Benchmark]: Toolchain (without parser) took 2702.26ms. Allocated memory is still 83.9MB. Free memory was 57.4MB in the beginning and 35.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-07 22:14:42,224 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 83.9MB. Free memory was 64.6MB in the beginning and 64.6MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:14:42,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.06ms. Allocated memory is still 83.9MB. Free memory was 57.1MB in the beginning and 51.3MB in the end (delta: 5.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-11-07 22:14:42,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.49ms. Allocated memory is still 83.9MB. Free memory was 51.3MB in the beginning and 48.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:14:42,225 INFO L158 Benchmark]: Boogie Preprocessor took 40.05ms. Allocated memory is still 83.9MB. Free memory was 48.2MB in the beginning and 46.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:14:42,225 INFO L158 Benchmark]: RCFGBuilder took 317.95ms. Allocated memory is still 83.9MB. Free memory was 46.2MB in the beginning and 32.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 22:14:42,225 INFO L158 Benchmark]: TraceAbstraction took 1488.30ms. Allocated memory is still 83.9MB. Free memory was 31.2MB in the beginning and 35.7MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:14:42,225 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 83.9MB. Free memory was 35.7MB in the beginning and 35.7MB in the end (delta: 4.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 22:14:42,226 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.04ms. Allocated memory is still 83.9MB. Free memory was 64.6MB in the beginning and 64.6MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.06ms. Allocated memory is still 83.9MB. Free memory was 57.1MB in the beginning and 51.3MB in the end (delta: 5.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.49ms. Allocated memory is still 83.9MB. Free memory was 51.3MB in the beginning and 48.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.05ms. Allocated memory is still 83.9MB. Free memory was 48.2MB in the beginning and 46.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 317.95ms. Allocated memory is still 83.9MB. Free memory was 46.2MB in the beginning and 32.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1488.30ms. Allocated memory is still 83.9MB. Free memory was 31.2MB in the beginning and 35.7MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 83.9MB. Free memory was 35.7MB in the beginning and 35.7MB in the end (delta: 4.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1585. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1586] CALL CWE190_Integer_Overflow__int_rand_postinc_12_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: 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 4 procedures, 41 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 100 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 22:14:42,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample