./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/nla-digbench-scaling/divbin_unwindbound1.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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', '32bit', '--witnessprinter.graph.data.programhash', 'e5903ff87e76f5c38f2f015436bd4a2c11a1411b3a93f272aa9f876a0a3f4d37'] 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/nla-digbench-scaling/divbin_unwindbound1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash e5903ff87e76f5c38f2f015436bd4a2c11a1411b3a93f272aa9f876a0a3f4d37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:19:55,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:19:55,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 20:19:55,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:19:55,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:19:55,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:19:55,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:19:55,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:19:55,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:19:55,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:19:55,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:19:55,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:19:55,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:19:55,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:19:55,442 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:19:55,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:19:55,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:19:55,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:19:55,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:19:55,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:19:55,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:19:55,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:19:55,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:19:55,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:19:55,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:19:55,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:19:55,445 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5903ff87e76f5c38f2f015436bd4a2c11a1411b3a93f272aa9f876a0a3f4d37 [2024-11-07 20:19:55,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:19:55,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:19:55,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:19:55,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:19:55,677 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:19:55,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound1.i [2024-11-07 20:19:56,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:19:56,980 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:19:56,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound1.i [2024-11-07 20:19:56,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e8ff32be/0524ad42a01944b39d0988a607623357/FLAGf62d14df4 [2024-11-07 20:19:57,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e8ff32be/0524ad42a01944b39d0988a607623357 [2024-11-07 20:19:57,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:19:57,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:19:57,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:19:57,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:19:57,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:19:57,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c7e147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57, skipping insertion in model container [2024-11-07 20:19:57,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:19:57,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:19:57,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:19:57,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:19:57,159 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:19:57,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57 WrapperNode [2024-11-07 20:19:57,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:19:57,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:19:57,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:19:57,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:19:57,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,177 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-07 20:19:57,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:19:57,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:19:57,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:19:57,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:19:57,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,189 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 20:19:57,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:19:57,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:19:57,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:19:57,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:19:57,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (1/1) ... [2024-11-07 20:19:57,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:19:57,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:57,224 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 20:19:57,229 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 20:19:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:19:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 20:19:57,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 20:19:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:19:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:19:57,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:19:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:19:57,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:19:57,283 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:19:57,285 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:19:57,418 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 20:19:57,419 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:19:57,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:19:57,428 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 20:19:57,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:57 BoogieIcfgContainer [2024-11-07 20:19:57,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:19:57,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:19:57,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:19:57,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:19:57,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:57" (1/3) ... [2024-11-07 20:19:57,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369e81c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:57, skipping insertion in model container [2024-11-07 20:19:57,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:57" (2/3) ... [2024-11-07 20:19:57,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369e81c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:57, skipping insertion in model container [2024-11-07 20:19:57,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:57" (3/3) ... [2024-11-07 20:19:57,435 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound1.i [2024-11-07 20:19:57,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:19:57,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 20:19:57,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:19:57,492 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;@6f5c4e30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:19:57,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 20:19:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 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 20:19:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:19:57,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:57,500 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:57,501 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 20:19:57,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:57,504 INFO L85 PathProgramCache]: Analyzing trace with hash -604571617, now seen corresponding path program 1 times [2024-11-07 20:19:57,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:57,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200555389] [2024-11-07 20:19:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:19:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:19:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200555389] [2024-11-07 20:19:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200555389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:57,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:57,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:19:57,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140776925] [2024-11-07 20:19:57,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:57,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 20:19:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:57,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 20:19:57,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:19:57,633 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:19:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:57,647 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2024-11-07 20:19:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 20:19:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-07 20:19:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:57,652 INFO L225 Difference]: With dead ends: 70 [2024-11-07 20:19:57,652 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 20:19:57,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 20:19:57,656 INFO L432 NwaCegarLoop]: 42 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, 42 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 20:19:57,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 20:19:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-07 20:19:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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 20:19:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-07 20:19:57,685 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2024-11-07 20:19:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:57,685 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-07 20:19:57,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:19:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-07 20:19:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:19:57,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:57,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:57,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:19:57,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:57,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash 153751263, now seen corresponding path program 1 times [2024-11-07 20:19:57,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:57,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760194191] [2024-11-07 20:19:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:19:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:19:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:57,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760194191] [2024-11-07 20:19:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760194191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:57,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:19:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427946759] [2024-11-07 20:19:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:19:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:19:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:19:57,817 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:57,862 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-07 20:19:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:19:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-07 20:19:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:57,863 INFO L225 Difference]: With dead ends: 34 [2024-11-07 20:19:57,863 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 20:19:57,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:19:57,864 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:57,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 20:19:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-07 20:19:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 20:19:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-07 20:19:57,867 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2024-11-07 20:19:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:57,868 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-07 20:19:57,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-07 20:19:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 20:19:57,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:57,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:57,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:19:57,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:57,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 471321901, now seen corresponding path program 1 times [2024-11-07 20:19:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151988726] [2024-11-07 20:19:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:19:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:19:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:57,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:57,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151988726] [2024-11-07 20:19:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151988726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:57,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:57,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:19:57,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662382331] [2024-11-07 20:19:57,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:57,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:19:57,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:19:57,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:19:57,939 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:57,968 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-07 20:19:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:19:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-07 20:19:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:57,971 INFO L225 Difference]: With dead ends: 46 [2024-11-07 20:19:57,971 INFO L226 Difference]: Without dead ends: 32 [2024-11-07 20:19:57,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:19:57,971 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:57,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-07 20:19:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-07 20:19:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 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 20:19:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-07 20:19:57,978 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2024-11-07 20:19:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:57,979 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-07 20:19:57,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-07 20:19:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 20:19:57,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:57,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:57,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:19:57,980 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 20:19:57,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2080735310, now seen corresponding path program 1 times [2024-11-07 20:19:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130957814] [2024-11-07 20:19:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:19:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:19:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130957814] [2024-11-07 20:19:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130957814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:19:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123403524] [2024-11-07 20:19:58,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:58,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:19:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:19:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:19:58,057 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:58,133 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-07 20:19:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 20:19:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-07 20:19:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:58,133 INFO L225 Difference]: With dead ends: 37 [2024-11-07 20:19:58,133 INFO L226 Difference]: Without dead ends: 23 [2024-11-07 20:19:58,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:19:58,134 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:58,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 39 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-07 20:19:58,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-07 20:19:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:19:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-07 20:19:58,138 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2024-11-07 20:19:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:58,138 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-07 20:19:58,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-07 20:19:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 20:19:58,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:58,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:58,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:19:58,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash -78285105, now seen corresponding path program 1 times [2024-11-07 20:19:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698442415] [2024-11-07 20:19:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:19:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:19:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:58,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698442415] [2024-11-07 20:19:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698442415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:58,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:58,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:19:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704890580] [2024-11-07 20:19:58,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:58,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:19:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:19:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:19:58,205 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:58,265 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-07 20:19:58,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:19:58,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-07 20:19:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:58,265 INFO L225 Difference]: With dead ends: 27 [2024-11-07 20:19:58,265 INFO L226 Difference]: Without dead ends: 23 [2024-11-07 20:19:58,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:19:58,266 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:58,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-07 20:19:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-07 20:19:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:19:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-07 20:19:58,272 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2024-11-07 20:19:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:58,272 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-07 20:19:58,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-07 20:19:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 20:19:58,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:58,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:58,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:19:58,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:58,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash -78246376, now seen corresponding path program 1 times [2024-11-07 20:19:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724841276] [2024-11-07 20:19:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:19:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:19:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:58,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:58,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724841276] [2024-11-07 20:19:58,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724841276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:58,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:58,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:19:58,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865688977] [2024-11-07 20:19:58,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:58,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:19:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:58,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:19:58,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:19:58,339 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:58,385 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-07 20:19:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:19:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-07 20:19:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:58,386 INFO L225 Difference]: With dead ends: 23 [2024-11-07 20:19:58,386 INFO L226 Difference]: Without dead ends: 22 [2024-11-07 20:19:58,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 20:19:58,387 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:58,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-07 20:19:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-07 20:19:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:19:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-07 20:19:58,392 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2024-11-07 20:19:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:58,393 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-07 20:19:58,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-07 20:19:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 20:19:58,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:58,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:58,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 20:19:58,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:58,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash 654806120, now seen corresponding path program 1 times [2024-11-07 20:19:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944454855] [2024-11-07 20:19:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:19:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-07 20:19:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944454855] [2024-11-07 20:19:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944454855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406866962] [2024-11-07 20:19:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:58,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:19:58,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 20:19:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:58,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:19:58,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:58,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:19:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:19:58,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406866962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:19:58,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:19:58,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 20:19:58,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33049156] [2024-11-07 20:19:58,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:19:58,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 20:19:58,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:58,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 20:19:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-07 20:19:58,660 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:58,717 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-07 20:19:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 20:19:58,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-07 20:19:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:58,719 INFO L225 Difference]: With dead ends: 22 [2024-11-07 20:19:58,719 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:19:58,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-07 20:19:58,720 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:58,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:19:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:19:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:19:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:19:58,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-11-07 20:19:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:58,720 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:19:58,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:19:58,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:19:58,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 20:19:58,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 20:19:58,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 20:19:58,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 20:19:58,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 20:19:58,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:58,931 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:58,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:19:58,985 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:19:59,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:19:59 BoogieIcfgContainer [2024-11-07 20:19:59,001 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:19:59,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:19:59,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:19:59,002 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:19:59,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:57" (3/4) ... [2024-11-07 20:19:59,004 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:19:59,007 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 20:19:59,007 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-07 20:19:59,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-07 20:19:59,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 20:19:59,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 20:19:59,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:19:59,057 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:19:59,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:19:59,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:19:59,061 INFO L158 Benchmark]: Toolchain (without parser) took 2054.29ms. Allocated memory is still 100.7MB. Free memory was 76.0MB in the beginning and 28.7MB in the end (delta: 47.3MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-07 20:19:59,062 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 83.9MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:19:59,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.81ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 64.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:19:59,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.44ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 63.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:19:59,062 INFO L158 Benchmark]: Boogie Preprocessor took 16.87ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 62.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:19:59,062 INFO L158 Benchmark]: RCFGBuilder took 232.11ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 51.7MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 20:19:59,062 INFO L158 Benchmark]: TraceAbstraction took 1571.51ms. Allocated memory is still 100.7MB. Free memory was 51.0MB in the beginning and 33.5MB in the end (delta: 17.5MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-07 20:19:59,062 INFO L158 Benchmark]: Witness Printer took 59.21ms. Allocated memory is still 100.7MB. Free memory was 33.5MB in the beginning and 28.7MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:19:59,063 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.58ms. Allocated memory is still 83.9MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.81ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 64.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.44ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 63.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.87ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 62.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 232.11ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 51.7MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1571.51ms. Allocated memory is still 100.7MB. Free memory was 51.0MB in the beginning and 33.5MB in the end (delta: 17.5MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Witness Printer took 59.21ms. Allocated memory is still 100.7MB. Free memory was 33.5MB in the beginning and 28.7MB in the end (delta: 4.8MB). 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 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 145 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 36, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 308 SizeOfPredicates, 3 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 48/51 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((counter == 0) || (counter == 1)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == 0) && (counter == \old(counter))) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-07 20:19:59,082 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 Writing output log to file Ultimate.log Result: TRUE