./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/trex04_abstracted.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/trex04_abstracted.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e71bfdbf7289a566b902257246387e0ad81598872b6a9647848f536f5a4d6edc --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 17:54:24,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:54:24,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:54:24,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:54:24,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:54:24,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:54:24,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:54:24,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:54:24,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:54:24,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:54:24,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:54:24,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:54:24,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:54:24,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:54:24,448 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:54:24,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:54:24,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:54:24,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:54:24,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:54:24,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:54:24,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:54:24,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:54:24,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:54:24,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:54:24,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:54:24,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:54:24,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:54:24,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:54:24,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:54:24,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:54:24,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:54:24,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:54:24,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:54:24,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:54:24,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:54:24,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:54:24,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:54:24,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:54:24,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:54:24,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:54:24,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:54:24,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:54:24,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer 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 ! call(reach_error())) ) 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 -> e71bfdbf7289a566b902257246387e0ad81598872b6a9647848f536f5a4d6edc Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 17:54:24,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:54:24,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:54:24,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:54:24,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:54:24,820 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:54:24,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/trex04_abstracted.c [2024-09-12 17:54:26,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:54:26,454 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:54:26,455 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/trex04_abstracted.c [2024-09-12 17:54:26,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/920c677da/a3bc24d499ef4b4cb0820afd77133d6f/FLAG50d442620 [2024-09-12 17:54:26,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/920c677da/a3bc24d499ef4b4cb0820afd77133d6f [2024-09-12 17:54:26,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:54:26,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:54:26,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:54:26,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:54:26,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:54:26,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:54:26" (1/1) ... [2024-09-12 17:54:26,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d883f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:26, skipping insertion in model container [2024-09-12 17:54:26,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:54:26" (1/1) ... [2024-09-12 17:54:26,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:54:27,030 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/trex04_abstracted.c[823,836] [2024-09-12 17:54:27,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:54:27,066 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:54:27,079 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/trex04_abstracted.c[823,836] [2024-09-12 17:54:27,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:54:27,112 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:54:27,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27 WrapperNode [2024-09-12 17:54:27,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:54:27,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:54:27,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:54:27,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:54:27,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,141 INFO L138 Inliner]: procedures = 22, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:54:27,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:54:27,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:54:27,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:54:27,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:54:27,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,170 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-09-12 17:54:27,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:54:27,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:54:27,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:54:27,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:54:27,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (1/1) ... [2024-09-12 17:54:27,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:54:27,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:54:27,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 17:54:27,226 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 17:54:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:54:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-09-12 17:54:27,274 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-09-12 17:54:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:54:27,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:54:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:54:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:54:27,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:54:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:54:27,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:54:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 17:54:27,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 17:54:27,345 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:54:27,348 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:54:27,557 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-09-12 17:54:27,561 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:54:27,584 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:54:27,588 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 17:54:27,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:54:27 BoogieIcfgContainer [2024-09-12 17:54:27,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:54:27,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:54:27,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:54:27,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:54:27,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:54:26" (1/3) ... [2024-09-12 17:54:27,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9e980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:54:27, skipping insertion in model container [2024-09-12 17:54:27,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:54:27" (2/3) ... [2024-09-12 17:54:27,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9e980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:54:27, skipping insertion in model container [2024-09-12 17:54:27,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:54:27" (3/3) ... [2024-09-12 17:54:27,598 INFO L112 eAbstractionObserver]: Analyzing ICFG trex04_abstracted.c [2024-09-12 17:54:27,615 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:54:27,616 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-09-12 17:54:27,676 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:54:27,683 INFO L336 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=All, 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;@1b11b79b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:54:27,683 INFO L337 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-09-12 17:54:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:54:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 17:54:27,698 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:27,699 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:27,699 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:27,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash 453213905, now seen corresponding path program 1 times [2024-09-12 17:54:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:27,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123814639] [2024-09-12 17:54:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:27,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123814639] [2024-09-12 17:54:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123814639] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 17:54:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52332507] [2024-09-12 17:54:27,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:27,955 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:54:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:54:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:54:27,982 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:28,065 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2024-09-12 17:54:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:54:28,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 17:54:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:28,075 INFO L225 Difference]: With dead ends: 77 [2024-09-12 17:54:28,075 INFO L226 Difference]: Without dead ends: 54 [2024-09-12 17:54:28,078 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:54:28,081 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:28,082 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-12 17:54:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-09-12 17:54:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 45 states have internal predecessors, (51), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:54:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-09-12 17:54:28,128 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 8 [2024-09-12 17:54:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:28,129 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-09-12 17:54:28,129 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2024-09-12 17:54:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 17:54:28,132 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:28,132 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:28,132 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:54:28,133 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:28,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash -411102509, now seen corresponding path program 1 times [2024-09-12 17:54:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:28,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099689726] [2024-09-12 17:54:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:28,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099689726] [2024-09-12 17:54:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099689726] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:28,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:54:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017155183] [2024-09-12 17:54:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:28,311 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:54:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:28,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:54:28,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:54:28,312 INFO L87 Difference]: Start difference. First operand 51 states and 63 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:28,363 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-09-12 17:54:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:54:28,364 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 17:54:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:28,366 INFO L225 Difference]: With dead ends: 56 [2024-09-12 17:54:28,367 INFO L226 Difference]: Without dead ends: 52 [2024-09-12 17:54:28,367 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-12 17:54:28,369 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:28,370 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-12 17:54:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-12 17:54:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 46 states have internal predecessors, (53), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:54:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2024-09-12 17:54:28,387 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 12 [2024-09-12 17:54:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:28,387 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2024-09-12 17:54:28,387 INFO L475 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2024-09-12 17:54:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 17:54:28,389 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:28,389 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:28,389 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:54:28,389 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:28,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 140730170, now seen corresponding path program 1 times [2024-09-12 17:54:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194703240] [2024-09-12 17:54:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:28,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194703240] [2024-09-12 17:54:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194703240] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:28,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:28,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:54:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555712737] [2024-09-12 17:54:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:28,516 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:54:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:28,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:54:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:54:28,519 INFO L87 Difference]: Start difference. First operand 52 states and 65 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:28,570 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-09-12 17:54:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:54:28,570 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-12 17:54:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:28,572 INFO L225 Difference]: With dead ends: 56 [2024-09-12 17:54:28,573 INFO L226 Difference]: Without dead ends: 54 [2024-09-12 17:54:28,573 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-12 17:54:28,575 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:28,576 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 116 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-12 17:54:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-12 17:54:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 48 states have internal predecessors, (55), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:54:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-09-12 17:54:28,586 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 13 [2024-09-12 17:54:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:28,587 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-09-12 17:54:28,587 INFO L475 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-09-12 17:54:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 17:54:28,590 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:28,593 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:28,594 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 17:54:28,594 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:28,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1923297502, now seen corresponding path program 1 times [2024-09-12 17:54:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398813339] [2024-09-12 17:54:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:28,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398813339] [2024-09-12 17:54:28,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398813339] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:28,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:54:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232069481] [2024-09-12 17:54:28,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:28,666 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:54:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:54:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:54:28,668 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:28,702 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2024-09-12 17:54:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:54:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 17:54:28,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:28,705 INFO L225 Difference]: With dead ends: 60 [2024-09-12 17:54:28,705 INFO L226 Difference]: Without dead ends: 59 [2024-09-12 17:54:28,705 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:54:28,706 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:28,707 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-12 17:54:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2024-09-12 17:54:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 47 states have internal predecessors, (54), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:54:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-12 17:54:28,716 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 14 [2024-09-12 17:54:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:28,716 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-12 17:54:28,716 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-12 17:54:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 17:54:28,718 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:28,718 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:28,718 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 17:54:28,718 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting fooErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:28,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2091921686, now seen corresponding path program 1 times [2024-09-12 17:54:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72941995] [2024-09-12 17:54:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72941995] [2024-09-12 17:54:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72941995] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:28,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:28,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:54:28,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053632392] [2024-09-12 17:54:28,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:28,794 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:54:28,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:28,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:54:28,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:54:28,795 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:28,846 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-09-12 17:54:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:54:28,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 17:54:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:28,849 INFO L225 Difference]: With dead ends: 53 [2024-09-12 17:54:28,850 INFO L226 Difference]: Without dead ends: 52 [2024-09-12 17:54:28,851 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:54:28,852 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:28,852 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 151 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-12 17:54:28,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-12 17:54:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 46 states have internal predecessors, (53), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:54:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2024-09-12 17:54:28,868 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 15 [2024-09-12 17:54:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:28,869 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2024-09-12 17:54:28,869 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:28,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2024-09-12 17:54:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 17:54:28,871 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:28,872 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:28,872 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 17:54:28,873 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:28,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2091921494, now seen corresponding path program 1 times [2024-09-12 17:54:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:28,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035432389] [2024-09-12 17:54:28,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:28,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035432389] [2024-09-12 17:54:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035432389] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:54:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553148267] [2024-09-12 17:54:28,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:28,963 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:54:28,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:28,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:54:28,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:54:28,964 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:29,015 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-09-12 17:54:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:54:29,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 17:54:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:29,017 INFO L225 Difference]: With dead ends: 52 [2024-09-12 17:54:29,017 INFO L226 Difference]: Without dead ends: 51 [2024-09-12 17:54:29,017 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:54:29,018 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:29,018 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 178 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-12 17:54:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-12 17:54:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.368421052631579) internal successors, (52), 45 states have internal predecessors, (52), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:54:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2024-09-12 17:54:29,028 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 15 [2024-09-12 17:54:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:29,029 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-09-12 17:54:29,029 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2024-09-12 17:54:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 17:54:29,032 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:29,032 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:29,032 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 17:54:29,032 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:29,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash 507319679, now seen corresponding path program 1 times [2024-09-12 17:54:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:29,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864970101] [2024-09-12 17:54:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:29,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:29,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:29,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:29,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864970101] [2024-09-12 17:54:29,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864970101] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:29,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:29,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:54:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072813215] [2024-09-12 17:54:29,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:29,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:54:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:54:29,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:54:29,095 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:29,129 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2024-09-12 17:54:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:54:29,130 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 17:54:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:29,130 INFO L225 Difference]: With dead ends: 57 [2024-09-12 17:54:29,131 INFO L226 Difference]: Without dead ends: 56 [2024-09-12 17:54:29,131 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-12 17:54:29,132 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:29,132 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 129 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-12 17:54:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2024-09-12 17:54:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.3125) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:54:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-09-12 17:54:29,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 15 [2024-09-12 17:54:29,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:29,145 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-09-12 17:54:29,145 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-09-12 17:54:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 17:54:29,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:29,146 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:29,146 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 17:54:29,146 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting fooErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:29,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,147 INFO L85 PathProgramCache]: Analyzing trace with hash 425062881, now seen corresponding path program 1 times [2024-09-12 17:54:29,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:29,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617475980] [2024-09-12 17:54:29,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:29,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617475980] [2024-09-12 17:54:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617475980] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:29,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:29,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:54:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880196879] [2024-09-12 17:54:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:29,203 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:54:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:29,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:54:29,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:54:29,205 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:29,228 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-09-12 17:54:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:54:29,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 17:54:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:29,230 INFO L225 Difference]: With dead ends: 42 [2024-09-12 17:54:29,230 INFO L226 Difference]: Without dead ends: 41 [2024-09-12 17:54:29,230 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:54:29,231 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:29,233 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-12 17:54:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-12 17:54:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:54:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-09-12 17:54:29,241 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 16 [2024-09-12 17:54:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:29,241 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-09-12 17:54:29,241 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-09-12 17:54:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 17:54:29,242 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:29,242 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:29,243 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 17:54:29,243 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting fooErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:29,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash 425056923, now seen corresponding path program 1 times [2024-09-12 17:54:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513898744] [2024-09-12 17:54:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:29,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:29,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:29,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513898744] [2024-09-12 17:54:29,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513898744] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:29,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:29,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:54:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975524256] [2024-09-12 17:54:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:29,325 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:54:29,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:29,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:54:29,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:54:29,326 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:29,363 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-09-12 17:54:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:54:29,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 17:54:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:29,366 INFO L225 Difference]: With dead ends: 41 [2024-09-12 17:54:29,367 INFO L226 Difference]: Without dead ends: 40 [2024-09-12 17:54:29,368 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:54:29,368 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:29,369 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-12 17:54:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-09-12 17:54:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:54:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-09-12 17:54:29,380 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 16 [2024-09-12 17:54:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:29,380 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-09-12 17:54:29,380 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-09-12 17:54:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 17:54:29,381 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:54:29,381 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:29,382 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 17:54:29,382 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-09-12 17:54:29,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2061292737, now seen corresponding path program 1 times [2024-09-12 17:54:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:54:29,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106335307] [2024-09-12 17:54:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:54:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:54:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:29,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:54:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:54:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:54:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106335307] [2024-09-12 17:54:29,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106335307] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:54:29,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:54:29,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:54:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324478765] [2024-09-12 17:54:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:54:29,444 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:54:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:54:29,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:54:29,445 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:54:29,475 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-09-12 17:54:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:54:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 17:54:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:54:29,476 INFO L225 Difference]: With dead ends: 36 [2024-09-12 17:54:29,476 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 17:54:29,476 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:54:29,477 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:54:29,479 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:54:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 17:54:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 17:54:29,479 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-09-12 17:54:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 17:54:29,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-09-12 17:54:29,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:54:29,482 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 17:54:29,482 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:54:29,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:54:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 17:54:29,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 17:54:29,486 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 11 remaining) [2024-09-12 17:54:29,486 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2024-09-12 17:54:29,487 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2024-09-12 17:54:29,487 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fooErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2024-09-12 17:54:29,487 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fooErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2024-09-12 17:54:29,487 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fooErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2024-09-12 17:54:29,487 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2024-09-12 17:54:29,487 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2024-09-12 17:54:29,488 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2024-09-12 17:54:29,488 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2024-09-12 17:54:29,488 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2024-09-12 17:54:29,488 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 17:54:29,491 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:54:29,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 17:54:29,626 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 17:54:29,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 05:54:29 BoogieIcfgContainer [2024-09-12 17:54:29,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 17:54:29,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 17:54:29,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 17:54:29,641 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 17:54:29,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:54:27" (3/4) ... [2024-09-12 17:54:29,645 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 17:54:29,649 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 17:54:29,649 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2024-09-12 17:54:29,649 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 17:54:29,650 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 17:54:29,654 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-09-12 17:54:29,654 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 17:54:29,654 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 17:54:29,654 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 17:54:29,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 17:54:29,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 17:54:29,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 17:54:29,747 INFO L158 Benchmark]: Toolchain (without parser) took 2919.83ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 53.8MB in the beginning and 39.9MB in the end (delta: 13.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-09-12 17:54:29,747 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 56.6MB. Free memory was 28.2MB in the beginning and 28.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 17:54:29,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.80ms. Allocated memory is still 75.5MB. Free memory was 53.6MB in the beginning and 41.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 17:54:29,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.78ms. Allocated memory is still 75.5MB. Free memory was 41.8MB in the beginning and 40.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 17:54:29,748 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 75.5MB. Free memory was 40.7MB in the beginning and 38.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 17:54:29,748 INFO L158 Benchmark]: RCFGBuilder took 400.34ms. Allocated memory is still 75.5MB. Free memory was 38.9MB in the beginning and 47.2MB in the end (delta: -8.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 17:54:29,749 INFO L158 Benchmark]: TraceAbstraction took 2049.59ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 46.5MB in the beginning and 45.4MB in the end (delta: 1.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-09-12 17:54:29,749 INFO L158 Benchmark]: Witness Printer took 105.80ms. Allocated memory is still 92.3MB. Free memory was 45.4MB in the beginning and 39.9MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 17:54:29,750 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.22ms. Allocated memory is still 56.6MB. Free memory was 28.2MB in the beginning and 28.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.80ms. Allocated memory is still 75.5MB. Free memory was 53.6MB in the beginning and 41.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.78ms. Allocated memory is still 75.5MB. Free memory was 41.8MB in the beginning and 40.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 75.5MB. Free memory was 40.7MB in the beginning and 38.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.34ms. Allocated memory is still 75.5MB. Free memory was 38.9MB in the beginning and 47.2MB in the end (delta: -8.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2049.59ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 46.5MB in the beginning and 45.4MB in the end (delta: 1.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 105.80ms. Allocated memory is still 92.3MB. Free memory was 45.4MB in the beginning and 39.9MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 1308 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 894 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 414 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=3, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 11 specifications checked. All of them hold - ProcedureContractResult [Line: 19]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-12 17:54:29,777 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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