./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/McCarthy91-2.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/recursive/McCarthy91-2.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 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c --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 19:48:51,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:48:51,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:48:51,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:48:51,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:48:51,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:48:51,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:48:51,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:48:51,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:48:51,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:48:51,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:48:51,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:48:51,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:48:51,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:48:51,408 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:48:51,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:48:51,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:48:51,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:48:51,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:48:51,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:48:51,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:48:51,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:48:51,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:48:51,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:48:51,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:48:51,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:48:51,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:48:51,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:48:51,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:48:51,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:48:51,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:48:51,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:48:51,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:48:51,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:48:51,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:48:51,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:48:51,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:48:51,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:48:51,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:48:51,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:48:51,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:48:51,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:48:51,423 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 -> 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c 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 19:48:51,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:48:51,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:48:51,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:48:51,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:48:51,750 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:48:51,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/McCarthy91-2.c [2024-09-12 19:48:53,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:48:53,460 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:48:53,462 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/McCarthy91-2.c [2024-09-12 19:48:53,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0d57c4a36/91aa057bbfca40f2a911b24c3058324c/FLAG64cebbb68 [2024-09-12 19:48:53,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0d57c4a36/91aa057bbfca40f2a911b24c3058324c [2024-09-12 19:48:53,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:48:53,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:48:53,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:48:53,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:48:53,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:48:53,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399183cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53, skipping insertion in model container [2024-09-12 19:48:53,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:48:53,692 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/recursive/McCarthy91-2.c[749,762] [2024-09-12 19:48:53,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:48:53,706 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:48:53,720 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/recursive/McCarthy91-2.c[749,762] [2024-09-12 19:48:53,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:48:53,736 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:48:53,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53 WrapperNode [2024-09-12 19:48:53,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:48:53,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:48:53,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:48:53,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:48:53,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,757 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:48:53,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:48:53,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:48:53,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:48:53,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:48:53,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,787 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 19:48:53,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:48:53,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:48:53,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:48:53,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:48:53,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (1/1) ... [2024-09-12 19:48:53,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:48:53,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:48:53,835 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 19:48:53,846 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 19:48:53,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:48:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:48:53,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:48:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:48:53,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:48:53,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:48:53,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:48:53,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:48:53,908 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2024-09-12 19:48:53,908 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2024-09-12 19:48:53,971 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:48:53,972 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:48:54,147 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-09-12 19:48:54,147 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:48:54,174 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:48:54,174 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:48:54,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:48:54 BoogieIcfgContainer [2024-09-12 19:48:54,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:48:54,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:48:54,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:48:54,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:48:54,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:48:53" (1/3) ... [2024-09-12 19:48:54,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8876d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:48:54, skipping insertion in model container [2024-09-12 19:48:54,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:48:53" (2/3) ... [2024-09-12 19:48:54,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8876d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:48:54, skipping insertion in model container [2024-09-12 19:48:54,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:48:54" (3/3) ... [2024-09-12 19:48:54,184 INFO L112 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2024-09-12 19:48:54,200 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:48:54,201 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-09-12 19:48:54,259 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:48:54,268 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;@4b17052d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:48:54,269 INFO L337 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-09-12 19:48:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 28 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:48:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-12 19:48:54,280 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:54,280 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:54,281 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:54,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1479022564, now seen corresponding path program 1 times [2024-09-12 19:48:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:54,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985112179] [2024-09-12 19:48:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:54,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:54,506 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 19:48:54,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985112179] [2024-09-12 19:48:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985112179] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:54,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:54,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:48:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278968479] [2024-09-12 19:48:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:54,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:48:54,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:54,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:48:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:48:54,538 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 28 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 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, (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 19:48:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:54,593 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-09-12 19:48:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:48:54,595 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, (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 9 [2024-09-12 19:48:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:54,603 INFO L225 Difference]: With dead ends: 41 [2024-09-12 19:48:54,604 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 19:48:54,606 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 19:48:54,612 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:54,613 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:48:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 19:48:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 19:48:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:48:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-12 19:48:54,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 9 [2024-09-12 19:48:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:54,653 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-12 19:48:54,653 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, (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 19:48:54,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-12 19:48:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-12 19:48:54,655 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:54,655 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:54,655 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:48:54,655 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:54,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1479022724, now seen corresponding path program 1 times [2024-09-12 19:48:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449612978] [2024-09-12 19:48:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:54,755 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:54,767 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 19:48:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:54,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449612978] [2024-09-12 19:48:54,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449612978] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:54,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:54,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:48:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211106335] [2024-09-12 19:48:54,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:54,773 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:48:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:54,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:48:54,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:48:54,774 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 19:48:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:54,931 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-09-12 19:48:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:48:54,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 9 [2024-09-12 19:48:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:54,934 INFO L225 Difference]: With dead ends: 53 [2024-09-12 19:48:54,934 INFO L226 Difference]: Without dead ends: 52 [2024-09-12 19:48:54,935 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 19:48:54,936 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:54,936 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 72 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-12 19:48:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-09-12 19:48:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 19:48:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-09-12 19:48:54,954 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 9 [2024-09-12 19:48:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:54,954 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-09-12 19:48:54,955 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 19:48:54,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-09-12 19:48:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 19:48:54,956 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:54,956 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:54,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:48:54,956 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:54,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1394940702, now seen corresponding path program 1 times [2024-09-12 19:48:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:54,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171827183] [2024-09-12 19:48:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,019 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 19:48:55,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:55,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171827183] [2024-09-12 19:48:55,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171827183] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:55,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:55,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:48:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279832174] [2024-09-12 19:48:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:55,021 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:48:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:48:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:48:55,022 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 19:48:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:55,114 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2024-09-12 19:48:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:48:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 10 [2024-09-12 19:48:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:55,116 INFO L225 Difference]: With dead ends: 68 [2024-09-12 19:48:55,116 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 19:48:55,117 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 19:48:55,118 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:55,118 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 19:48:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2024-09-12 19:48:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 19:48:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-09-12 19:48:55,140 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 10 [2024-09-12 19:48:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:55,140 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-09-12 19:48:55,141 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 19:48:55,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-09-12 19:48:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 19:48:55,142 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:55,142 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:55,142 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 19:48:55,142 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:55,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1394935737, now seen corresponding path program 1 times [2024-09-12 19:48:55,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:55,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416035416] [2024-09-12 19:48:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:55,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,192 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 19:48:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:55,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416035416] [2024-09-12 19:48:55,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416035416] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:55,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:55,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:48:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593134655] [2024-09-12 19:48:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:55,194 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:48:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:55,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:48:55,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:48:55,197 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 19:48:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:55,231 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-09-12 19:48:55,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:48:55,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 10 [2024-09-12 19:48:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:55,233 INFO L225 Difference]: With dead ends: 61 [2024-09-12 19:48:55,234 INFO L226 Difference]: Without dead ends: 60 [2024-09-12 19:48:55,234 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 19:48:55,235 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:55,236 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:48:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-12 19:48:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2024-09-12 19:48:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 40 states have internal predecessors, (46), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 19:48:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-09-12 19:48:55,264 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 10 [2024-09-12 19:48:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:55,265 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-09-12 19:48:55,265 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 19:48:55,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-09-12 19:48:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 19:48:55,266 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:55,266 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:55,266 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 19:48:55,267 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:55,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,267 INFO L85 PathProgramCache]: Analyzing trace with hash -78660459, now seen corresponding path program 1 times [2024-09-12 19:48:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997740434] [2024-09-12 19:48:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:48:55,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:55,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997740434] [2024-09-12 19:48:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997740434] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:55,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:55,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:48:55,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749245776] [2024-09-12 19:48:55,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:55,343 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:48:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:48:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:48:55,344 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:48:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:55,442 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2024-09-12 19:48:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:48:55,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 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 19:48:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:55,445 INFO L225 Difference]: With dead ends: 76 [2024-09-12 19:48:55,445 INFO L226 Difference]: Without dead ends: 75 [2024-09-12 19:48:55,445 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:48:55,446 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:55,447 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-12 19:48:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2024-09-12 19:48:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:48:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-09-12 19:48:55,473 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 15 [2024-09-12 19:48:55,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:55,474 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-09-12 19:48:55,474 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:48:55,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-09-12 19:48:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 19:48:55,475 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:55,475 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:55,475 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 19:48:55,476 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:55,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1857108366, now seen corresponding path program 1 times [2024-09-12 19:48:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:55,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867416841] [2024-09-12 19:48:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:48:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,518 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 19:48:55,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:55,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867416841] [2024-09-12 19:48:55,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867416841] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:55,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:55,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:48:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704859521] [2024-09-12 19:48:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:55,519 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:48:55,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:55,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:48:55,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:48:55,521 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:55,542 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-09-12 19:48:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:48:55,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-12 19:48:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:55,544 INFO L225 Difference]: With dead ends: 69 [2024-09-12 19:48:55,544 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 19:48:55,544 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 19:48:55,545 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:55,546 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:48:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 19:48:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-12 19:48:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 49 states have internal predecessors, (55), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:48:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-09-12 19:48:55,568 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 16 [2024-09-12 19:48:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:55,568 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-09-12 19:48:55,568 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:55,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-09-12 19:48:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 19:48:55,571 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:55,571 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:55,571 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 19:48:55,572 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:55,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1857109871, now seen corresponding path program 1 times [2024-09-12 19:48:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:55,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108436101] [2024-09-12 19:48:55,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:55,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:48:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,643 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 19:48:55,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108436101] [2024-09-12 19:48:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108436101] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:55,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:55,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:48:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111356973] [2024-09-12 19:48:55,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:55,644 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 19:48:55,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:55,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 19:48:55,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:48:55,646 INFO L87 Difference]: Start difference. First operand 66 states and 76 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:55,684 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2024-09-12 19:48:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 19:48:55,689 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-12 19:48:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:55,690 INFO L225 Difference]: With dead ends: 67 [2024-09-12 19:48:55,690 INFO L226 Difference]: Without dead ends: 66 [2024-09-12 19:48:55,690 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 19:48:55,691 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:55,692 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:48:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-12 19:48:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-09-12 19:48:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.173913043478261) internal successors, (54), 48 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:48:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-09-12 19:48:55,704 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 16 [2024-09-12 19:48:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:55,704 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-09-12 19:48:55,704 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:55,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-09-12 19:48:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 19:48:55,705 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:55,706 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:55,706 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 19:48:55,706 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:55,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2023622734, now seen corresponding path program 1 times [2024-09-12 19:48:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:55,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903146455] [2024-09-12 19:48:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:48:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:55,938 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 19:48:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:55,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903146455] [2024-09-12 19:48:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903146455] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:55,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:55,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 19:48:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773018185] [2024-09-12 19:48:55,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:55,942 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:48:55,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:48:55,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:48:55,943 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:56,095 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2024-09-12 19:48:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:48:56,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-12 19:48:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:56,097 INFO L225 Difference]: With dead ends: 82 [2024-09-12 19:48:56,097 INFO L226 Difference]: Without dead ends: 78 [2024-09-12 19:48:56,098 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:48:56,099 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:56,100 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-12 19:48:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2024-09-12 19:48:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.16) internal successors, (58), 52 states have internal predecessors, (58), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-12 19:48:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-09-12 19:48:56,125 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 18 [2024-09-12 19:48:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:56,125 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-09-12 19:48:56,125 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:56,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2024-09-12 19:48:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 19:48:56,127 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:56,127 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:56,127 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 19:48:56,127 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:56,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 741147734, now seen corresponding path program 1 times [2024-09-12 19:48:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890212331] [2024-09-12 19:48:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:48:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,250 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 19:48:56,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890212331] [2024-09-12 19:48:56,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890212331] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:56,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:56,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 19:48:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314131973] [2024-09-12 19:48:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:56,252 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:48:56,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:56,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:48:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:48:56,253 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:56,379 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-09-12 19:48:56,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:48:56,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-12 19:48:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:56,381 INFO L225 Difference]: With dead ends: 82 [2024-09-12 19:48:56,381 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 19:48:56,382 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:48:56,382 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:56,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 19:48:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-09-12 19:48:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:48:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-09-12 19:48:56,407 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 20 [2024-09-12 19:48:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:56,407 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-09-12 19:48:56,408 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:56,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-09-12 19:48:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 19:48:56,414 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:56,414 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:56,414 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 19:48:56,415 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:56,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1935104248, now seen corresponding path program 1 times [2024-09-12 19:48:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028628323] [2024-09-12 19:48:56,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:48:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:48:56,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:56,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028628323] [2024-09-12 19:48:56,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028628323] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:56,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:48:56,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850446929] [2024-09-12 19:48:56,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:56,493 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:48:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:56,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:48:56,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:48:56,494 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:56,625 INFO L93 Difference]: Finished difference Result 117 states and 150 transitions. [2024-09-12 19:48:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 19:48:56,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-09-12 19:48:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:56,628 INFO L225 Difference]: With dead ends: 117 [2024-09-12 19:48:56,628 INFO L226 Difference]: Without dead ends: 116 [2024-09-12 19:48:56,628 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:48:56,629 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:56,629 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 151 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-12 19:48:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2024-09-12 19:48:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 76 states have internal predecessors, (81), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2024-09-12 19:48:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2024-09-12 19:48:56,656 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 22 [2024-09-12 19:48:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:56,656 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2024-09-12 19:48:56,657 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:48:56,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2024-09-12 19:48:56,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 19:48:56,659 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:56,659 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:56,659 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 19:48:56,659 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:56,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash -141315346, now seen corresponding path program 1 times [2024-09-12 19:48:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725085736] [2024-09-12 19:48:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:48:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:48:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725085736] [2024-09-12 19:48:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725085736] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:48:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851231103] [2024-09-12 19:48:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:56,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:48:56,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:48:56,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:48:56,771 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 19:48:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:56,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 19:48:56,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:48:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:48:56,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:48:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:48:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851231103] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:48:57,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:48:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2024-09-12 19:48:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804940428] [2024-09-12 19:48:57,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:48:57,176 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 19:48:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 19:48:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-09-12 19:48:57,177 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 23 states, 20 states have (on average 2.25) internal successors, (45), 18 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:48:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:57,491 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2024-09-12 19:48:57,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 19:48:57,492 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.25) internal successors, (45), 18 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2024-09-12 19:48:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:57,493 INFO L225 Difference]: With dead ends: 119 [2024-09-12 19:48:57,493 INFO L226 Difference]: Without dead ends: 118 [2024-09-12 19:48:57,494 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2024-09-12 19:48:57,495 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 94 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:57,495 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 114 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-12 19:48:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2024-09-12 19:48:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2024-09-12 19:48:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-09-12 19:48:57,516 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 23 [2024-09-12 19:48:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:57,517 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-09-12 19:48:57,517 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.25) internal successors, (45), 18 states have internal predecessors, (45), 9 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:48:57,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2024-09-12 19:48:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 19:48:57,521 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:57,522 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:57,538 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 19:48:57,722 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-12 19:48:57,723 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:57,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash -228998233, now seen corresponding path program 1 times [2024-09-12 19:48:57,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:57,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51659906] [2024-09-12 19:48:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:57,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:57,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:48:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:57,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:48:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:57,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-12 19:48:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:48:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51659906] [2024-09-12 19:48:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51659906] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:48:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021527234] [2024-09-12 19:48:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:48:58,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:48:58,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:48:58,014 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 19:48:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:58,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 19:48:58,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:48:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:48:58,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:48:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 19:48:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021527234] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:48:58,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:48:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 19 [2024-09-12 19:48:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951981204] [2024-09-12 19:48:58,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:48:58,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 19:48:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:58,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 19:48:58,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-09-12 19:48:58,546 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:48:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:58,725 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-09-12 19:48:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:48:58,726 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2024-09-12 19:48:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:58,729 INFO L225 Difference]: With dead ends: 108 [2024-09-12 19:48:58,729 INFO L226 Difference]: Without dead ends: 96 [2024-09-12 19:48:58,730 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-09-12 19:48:58,730 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:58,731 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 89 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-12 19:48:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-09-12 19:48:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 65 states have internal predecessors, (68), 21 states have call successors, (21), 8 states have call predecessors, (21), 9 states have return successors, (23), 18 states have call predecessors, (23), 17 states have call successors, (23) [2024-09-12 19:48:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2024-09-12 19:48:58,759 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 34 [2024-09-12 19:48:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:58,760 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2024-09-12 19:48:58,760 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:48:58,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2024-09-12 19:48:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-12 19:48:58,762 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:48:58,762 INFO L216 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:58,779 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 19:48:58,963 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 19:48:58,963 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-09-12 19:48:58,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash 668876899, now seen corresponding path program 1 times [2024-09-12 19:48:58,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:48:58,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764272127] [2024-09-12 19:48:58,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:48:58,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:48:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:59,025 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:48:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:59,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:48:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:59,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:48:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:59,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-12 19:48:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:48:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 19:48:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:48:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764272127] [2024-09-12 19:48:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764272127] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:48:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:48:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 19:48:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681259149] [2024-09-12 19:48:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:48:59,094 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:48:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:48:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:48:59,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:48:59,095 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-12 19:48:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:48:59,236 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2024-09-12 19:48:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 19:48:59,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2024-09-12 19:48:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:48:59,237 INFO L225 Difference]: With dead ends: 96 [2024-09-12 19:48:59,237 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:48:59,238 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-09-12 19:48:59,239 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:48:59,239 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 93 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:48:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:48:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:48:59,240 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 19:48:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:48:59,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2024-09-12 19:48:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:48:59,241 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:48:59,241 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-12 19:48:59,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:48:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:48:59,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:48:59,244 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2024-09-12 19:48:59,245 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2024-09-12 19:48:59,245 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-09-12 19:48:59,245 INFO L785 garLoopResultBuilder]: Registering result SAFE for location f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2024-09-12 19:48:59,245 INFO L785 garLoopResultBuilder]: Registering result SAFE for location f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2024-09-12 19:48:59,246 INFO L785 garLoopResultBuilder]: Registering result SAFE for location f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2024-09-12 19:48:59,247 INFO L785 garLoopResultBuilder]: Registering result SAFE for location f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2024-09-12 19:48:59,247 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 19:48:59,250 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:48:59,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:49:01,078 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 19:49:01,095 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-12 19:49:01,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 07:49:01 BoogieIcfgContainer [2024-09-12 19:49:01,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 19:49:01,097 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 19:49:01,097 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 19:49:01,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 19:49:01,098 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:48:54" (3/4) ... [2024-09-12 19:49:01,105 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 19:49:01,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 19:49:01,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 19:49:01,108 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f91 [2024-09-12 19:49:01,112 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 19:49:01,112 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 19:49:01,112 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 19:49:01,112 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 19:49:01,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 19:49:01,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 19:49:01,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 19:49:01,198 INFO L158 Benchmark]: Toolchain (without parser) took 7705.43ms. Allocated memory was 67.1MB in the beginning and 153.1MB in the end (delta: 86.0MB). Free memory was 45.1MB in the beginning and 103.2MB in the end (delta: -58.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-09-12 19:49:01,198 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 29.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:49:01,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.60ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 34.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 19:49:01,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.90ms. Allocated memory is still 67.1MB. Free memory was 33.8MB in the beginning and 33.0MB in the end (delta: 830.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:49:01,198 INFO L158 Benchmark]: Boogie Preprocessor took 36.96ms. Allocated memory is still 67.1MB. Free memory was 32.8MB in the beginning and 31.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 19:49:01,199 INFO L158 Benchmark]: RCFGBuilder took 377.64ms. Allocated memory is still 67.1MB. Free memory was 31.3MB in the beginning and 36.8MB in the end (delta: -5.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-09-12 19:49:01,199 INFO L158 Benchmark]: TraceAbstraction took 6919.86ms. Allocated memory was 67.1MB in the beginning and 153.1MB in the end (delta: 86.0MB). Free memory was 36.2MB in the beginning and 108.4MB in the end (delta: -72.2MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-09-12 19:49:01,199 INFO L158 Benchmark]: Witness Printer took 99.85ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 103.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 19:49:01,201 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.20ms. Allocated memory is still 52.4MB. Free memory is still 29.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.60ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 34.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.90ms. Allocated memory is still 67.1MB. Free memory was 33.8MB in the beginning and 33.0MB in the end (delta: 830.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.96ms. Allocated memory is still 67.1MB. Free memory was 32.8MB in the beginning and 31.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 377.64ms. Allocated memory is still 67.1MB. Free memory was 31.3MB in the beginning and 36.8MB in the end (delta: -5.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6919.86ms. Allocated memory was 67.1MB in the beginning and 153.1MB in the end (delta: 86.0MB). Free memory was 36.2MB in the beginning and 108.4MB in the end (delta: -72.2MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * Witness Printer took 99.85ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 103.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 1120 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 800 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1107 IncrementalHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 320 mSDtfsCounter, 1107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 158 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=10, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 78 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 837 SizeOfPredicates, 6 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 83/110 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 7 specifications checked. All of them hold - ProcedureContractResult [Line: 17]: Procedure Contract for f91 Derived contract for procedure f91. Requires: (((\old(x) <= 2147483648) && (91 <= \old(x))) || ((\old(x) <= 2147483647) && (0 <= (\old(x) + 2147483648)))) Ensures: (0 <= (\old(x) + 2147483648)) RESULT: Ultimate proved your program to be correct! [2024-09-12 19:49:01,227 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