./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_2-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-simple/fibo_2calls_2-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 6597d5a31aa324ba443314d2c363b302cd71d697c12811ade53ae3225a095206 --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:52:40,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:52:40,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:52:40,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:52:40,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:52:40,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:52:40,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:52:40,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:52:40,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:52:40,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:52:40,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:52:40,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:52:40,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:52:40,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:52:40,703 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:52:40,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:52:40,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:52:40,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:52:40,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:52:40,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:52:40,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:52:40,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:52:40,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:52:40,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:52:40,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:52:40,707 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:52:40,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:52:40,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:52:40,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:52:40,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:52:40,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:52:40,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:52:40,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:52:40,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:52:40,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:52:40,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:52:40,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:52:40,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:52:40,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:52:40,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:52:40,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:52:40,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:52:40,712 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 -> 6597d5a31aa324ba443314d2c363b302cd71d697c12811ade53ae3225a095206 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:52:41,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:52:41,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:52:41,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:52:41,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:52:41,083 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:52:41,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2024-09-12 19:52:42,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:52:42,633 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:52:42,633 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2024-09-12 19:52:42,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c6b369ba3/fdfb76722bd84695a23df7d0cd67912e/FLAGd013dcdab [2024-09-12 19:52:42,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c6b369ba3/fdfb76722bd84695a23df7d0cd67912e [2024-09-12 19:52:42,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:52:42,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:52:42,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:52:42,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:52:42,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:52:42,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e37a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42, skipping insertion in model container [2024-09-12 19:52:42,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:52:42,849 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-simple/fibo_2calls_2-2.c[946,959] [2024-09-12 19:52:42,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:52:42,870 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:52:42,887 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-simple/fibo_2calls_2-2.c[946,959] [2024-09-12 19:52:42,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:52:42,906 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:52:42,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42 WrapperNode [2024-09-12 19:52:42,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:52:42,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:52:42,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:52:42,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:52:42,916 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:52:42" (1/1) ... [2024-09-12 19:52:42,923 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:52:42" (1/1) ... [2024-09-12 19:52:42,930 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:52:42,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:52:42,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:52:42,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:52:42,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:52:42,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,963 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:52:42,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:52:42,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:52:42,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:52:42,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:52:42,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (1/1) ... [2024-09-12 19:52:42,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:52:43,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:52:43,018 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:52:43,023 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:52:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:52:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:52:43,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:52:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:52:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-12 19:52:43,070 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-12 19:52:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-12 19:52:43,071 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-12 19:52:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:52:43,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:52:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:52:43,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:52:43,135 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:52:43,137 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:52:43,337 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-12 19:52:43,338 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:52:43,364 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:52:43,364 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:52:43,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:52:43 BoogieIcfgContainer [2024-09-12 19:52:43,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:52:43,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:52:43,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:52:43,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:52:43,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:52:42" (1/3) ... [2024-09-12 19:52:43,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b27589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:52:43, skipping insertion in model container [2024-09-12 19:52:43,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:52:42" (2/3) ... [2024-09-12 19:52:43,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b27589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:52:43, skipping insertion in model container [2024-09-12 19:52:43,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:52:43" (3/3) ... [2024-09-12 19:52:43,376 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2024-09-12 19:52:43,393 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:52:43,394 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-09-12 19:52:43,464 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:52:43,473 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;@711f6dd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:52:43,474 INFO L337 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-09-12 19:52:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 44 states have internal predecessors, (49), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:52:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 19:52:43,484 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:43,485 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:43,486 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:43,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:43,493 INFO L85 PathProgramCache]: Analyzing trace with hash -373964005, now seen corresponding path program 1 times [2024-09-12 19:52:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824969761] [2024-09-12 19:52:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:43,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:43,784 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:52:43,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:43,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824969761] [2024-09-12 19:52:43,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824969761] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:43,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:52:43,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:52:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921400878] [2024-09-12 19:52:43,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:43,793 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:52:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:52:43,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:52:43,819 INFO L87 Difference]: Start difference. First operand has 56 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 44 states have internal predecessors, (49), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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:52:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:43,953 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2024-09-12 19:52:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:52:43,957 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:52:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:43,965 INFO L225 Difference]: With dead ends: 87 [2024-09-12 19:52:43,965 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 19:52:43,968 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:52:43,973 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:43,974 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 202 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:52:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 19:52:44,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-09-12 19:52:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 53 states have internal predecessors, (59), 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:52:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2024-09-12 19:52:44,037 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 10 [2024-09-12 19:52:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:44,040 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2024-09-12 19:52:44,040 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:52:44,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2024-09-12 19:52:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 19:52:44,045 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:44,045 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:52:44,045 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:52:44,045 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:44,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1677154791, now seen corresponding path program 1 times [2024-09-12 19:52:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672991700] [2024-09-12 19:52:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:44,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,140 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:52:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672991700] [2024-09-12 19:52:44,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672991700] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:44,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:52:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:52:44,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717632912] [2024-09-12 19:52:44,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:44,146 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:52:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:44,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:52:44,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:52:44,149 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 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:52:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:44,197 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2024-09-12 19:52:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:52:44,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 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 16 [2024-09-12 19:52:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:44,201 INFO L225 Difference]: With dead ends: 69 [2024-09-12 19:52:44,203 INFO L226 Difference]: Without dead ends: 67 [2024-09-12 19:52:44,205 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:52:44,206 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:44,207 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 88 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:52:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-12 19:52:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2024-09-12 19:52:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 51 states have internal predecessors, (57), 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:52:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-09-12 19:52:44,233 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 16 [2024-09-12 19:52:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:44,236 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-09-12 19:52:44,236 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 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:52:44,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-09-12 19:52:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 19:52:44,237 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:44,237 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:44,237 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:52:44,238 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:44,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash -452190908, now seen corresponding path program 1 times [2024-09-12 19:52:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390504273] [2024-09-12 19:52:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,364 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:52:44,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390504273] [2024-09-12 19:52:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390504273] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:44,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:52:44,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:52:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284286449] [2024-09-12 19:52:44,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:44,366 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:52:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:44,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:52:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:52:44,367 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 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:52:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:44,547 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-09-12 19:52:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:52:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 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 17 [2024-09-12 19:52:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:44,551 INFO L225 Difference]: With dead ends: 88 [2024-09-12 19:52:44,551 INFO L226 Difference]: Without dead ends: 86 [2024-09-12 19:52:44,552 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:52:44,553 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 52 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:44,553 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 225 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:52:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-12 19:52:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-09-12 19:52:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 63 states have internal predecessors, (73), 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:52:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-09-12 19:52:44,576 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 17 [2024-09-12 19:52:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:44,576 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-09-12 19:52:44,577 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 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:52:44,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-09-12 19:52:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 19:52:44,578 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:44,578 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:44,578 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 19:52:44,579 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:44,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1494133485, now seen corresponding path program 1 times [2024-09-12 19:52:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:44,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904472856] [2024-09-12 19:52:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:44,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904472856] [2024-09-12 19:52:44,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904472856] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:44,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:52:44,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:52:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555781106] [2024-09-12 19:52:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:44,623 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:52:44,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:44,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:52:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:52:44,624 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:52:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:44,649 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2024-09-12 19:52:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:52:44,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-12 19:52:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:44,651 INFO L225 Difference]: With dead ends: 82 [2024-09-12 19:52:44,651 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 19:52:44,651 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:52:44,652 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:44,653 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:52:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 19:52:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-09-12 19:52:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 61 states have internal predecessors, (71), 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:52:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-09-12 19:52:44,670 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 22 [2024-09-12 19:52:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:44,670 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-09-12 19:52:44,670 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:52:44,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-09-12 19:52:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 19:52:44,672 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:44,672 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:44,672 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 19:52:44,672 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:44,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash -926502134, now seen corresponding path program 1 times [2024-09-12 19:52:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:44,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228575865] [2024-09-12 19:52:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:52:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228575865] [2024-09-12 19:52:44,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228575865] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:44,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:52:44,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 19:52:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896049432] [2024-09-12 19:52:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:44,789 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:52:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:52:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:52:44,790 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:52:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:44,881 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2024-09-12 19:52:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:52:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-09-12 19:52:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:44,882 INFO L225 Difference]: With dead ends: 98 [2024-09-12 19:52:44,882 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 19:52:44,883 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:52:44,884 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:44,884 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 86 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:52:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 19:52:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 19:52:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:52:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-09-12 19:52:44,890 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 23 [2024-09-12 19:52:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:44,890 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-09-12 19:52:44,891 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:52:44,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-09-12 19:52:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 19:52:44,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:44,892 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:44,892 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 19:52:44,892 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:44,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2127521631, now seen corresponding path program 1 times [2024-09-12 19:52:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299462316] [2024-09-12 19:52:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:52:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-12 19:52:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:52:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299462316] [2024-09-12 19:52:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299462316] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:44,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:52:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:52:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678516630] [2024-09-12 19:52:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:44,998 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:52:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:52:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:52:44,999 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:52:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:45,041 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-09-12 19:52:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:52:45,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-12 19:52:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:45,043 INFO L225 Difference]: With dead ends: 46 [2024-09-12 19:52:45,043 INFO L226 Difference]: Without dead ends: 44 [2024-09-12 19:52:45,043 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:52:45,044 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:45,045 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:52:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-12 19:52:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-09-12 19:52:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-12 19:52:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-09-12 19:52:45,053 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 26 [2024-09-12 19:52:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:45,054 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-09-12 19:52:45,054 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:52:45,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-09-12 19:52:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 19:52:45,056 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:45,056 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:45,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 19:52:45,057 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:45,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1539493548, now seen corresponding path program 1 times [2024-09-12 19:52:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032136739] [2024-09-12 19:52:45,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:45,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:52:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-12 19:52:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032136739] [2024-09-12 19:52:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032136739] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:52:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922136036] [2024-09-12 19:52:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:52:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:52:45,165 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:52:45,168 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:52:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 19:52:45,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:52:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:52:45,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:52:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922136036] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:52:45,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2024-09-12 19:52:45,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948527530] [2024-09-12 19:52:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:45,321 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:52:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:45,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:52:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:52:45,322 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 19:52:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:45,399 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2024-09-12 19:52:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:52:45,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-09-12 19:52:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:45,401 INFO L225 Difference]: With dead ends: 59 [2024-09-12 19:52:45,401 INFO L226 Difference]: Without dead ends: 34 [2024-09-12 19:52:45,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-12 19:52:45,402 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:45,402 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 93 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:52:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-12 19:52:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-12 19:52:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-12 19:52:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-09-12 19:52:45,417 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2024-09-12 19:52:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:45,417 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-09-12 19:52:45,417 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 19:52:45,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-09-12 19:52:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 19:52:45,420 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:45,420 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:45,440 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 19:52:45,621 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 19:52:45,621 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:45,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1201179510, now seen corresponding path program 2 times [2024-09-12 19:52:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481869772] [2024-09-12 19:52:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:52:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:52:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481869772] [2024-09-12 19:52:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481869772] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:52:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288166165] [2024-09-12 19:52:45,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:52:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:52:45,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:52:45,726 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:52:45,727 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:52:45,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:52:45,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:52:45,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 19:52:45,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:52:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:45,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:52:45,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288166165] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:45,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:52:45,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-09-12 19:52:45,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944512490] [2024-09-12 19:52:45,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:45,823 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:52:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:45,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:52:45,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:52:45,824 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:52:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:45,856 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-09-12 19:52:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:52:45,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-09-12 19:52:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:45,857 INFO L225 Difference]: With dead ends: 34 [2024-09-12 19:52:45,857 INFO L226 Difference]: Without dead ends: 33 [2024-09-12 19:52:45,858 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:52:45,858 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:45,859 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:52:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-12 19:52:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-12 19:52:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-12 19:52:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-09-12 19:52:45,873 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2024-09-12 19:52:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:45,873 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-09-12 19:52:45,873 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:52:45,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-09-12 19:52:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 19:52:45,874 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:45,874 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:45,892 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 19:52:46,075 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:52:46,075 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:46,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1418140953, now seen corresponding path program 1 times [2024-09-12 19:52:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682759699] [2024-09-12 19:52:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:52:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:52:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682759699] [2024-09-12 19:52:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682759699] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:52:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991154530] [2024-09-12 19:52:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:46,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:52:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:52:46,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:52:46,153 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 19:52:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 19:52:46,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:52:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:46,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:52:46,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991154530] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:46,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:52:46,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-09-12 19:52:46,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131934009] [2024-09-12 19:52:46,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:46,257 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:52:46,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:46,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:52:46,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:52:46,258 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:52:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:46,290 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-09-12 19:52:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:52:46,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-09-12 19:52:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:46,291 INFO L225 Difference]: With dead ends: 37 [2024-09-12 19:52:46,292 INFO L226 Difference]: Without dead ends: 36 [2024-09-12 19:52:46,292 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:52:46,294 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:46,294 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 119 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:52:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-12 19:52:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-12 19:52:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-12 19:52:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-09-12 19:52:46,305 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 28 [2024-09-12 19:52:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:46,306 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-09-12 19:52:46,306 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:52:46,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-09-12 19:52:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 19:52:46,308 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:46,308 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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:52:46,325 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:52:46,509 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-12 19:52:46,509 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:46,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1348498850, now seen corresponding path program 1 times [2024-09-12 19:52:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129009158] [2024-09-12 19:52:46,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:52:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:52:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:52:46,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:46,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129009158] [2024-09-12 19:52:46,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129009158] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:46,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:52:46,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:52:46,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12373442] [2024-09-12 19:52:46,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:46,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:52:46,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:46,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:52:46,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:52:46,594 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:52:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:46,621 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-09-12 19:52:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:52:46,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-09-12 19:52:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:46,622 INFO L225 Difference]: With dead ends: 36 [2024-09-12 19:52:46,622 INFO L226 Difference]: Without dead ends: 35 [2024-09-12 19:52:46,622 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:52:46,623 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:46,624 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:52:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-12 19:52:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-09-12 19:52:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-12 19:52:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-09-12 19:52:46,630 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2024-09-12 19:52:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:46,630 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-09-12 19:52:46,630 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:52:46,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-09-12 19:52:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 19:52:46,632 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:46,632 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:46,632 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 19:52:46,632 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:46,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:46,633 INFO L85 PathProgramCache]: Analyzing trace with hash 348002345, now seen corresponding path program 1 times [2024-09-12 19:52:46,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:46,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954463663] [2024-09-12 19:52:46,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:46,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,675 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:52:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:52:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-12 19:52:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:46,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954463663] [2024-09-12 19:52:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954463663] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:52:46,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300886597] [2024-09-12 19:52:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:46,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:52:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:52:46,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:52:46,774 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 19:52:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:46,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 19:52:46,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:52:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:46,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:52:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:46,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300886597] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:52:46,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:52:46,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2024-09-12 19:52:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27389626] [2024-09-12 19:52:46,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:52:46,971 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:52:46,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:46,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:52:46,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:52:46,972 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 19:52:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:47,020 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2024-09-12 19:52:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 19:52:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-12 19:52:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:47,022 INFO L225 Difference]: With dead ends: 41 [2024-09-12 19:52:47,022 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 19:52:47,022 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:52:47,024 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:47,024 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 201 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:52:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 19:52:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-12 19:52:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:52:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-09-12 19:52:47,032 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 33 [2024-09-12 19:52:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:47,033 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-09-12 19:52:47,033 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 19:52:47,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-09-12 19:52:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 19:52:47,036 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:52:47,036 INFO L216 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2024-09-12 19:52:47,054 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:52:47,240 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:52:47,241 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 19:52:47,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1396462272, now seen corresponding path program 1 times [2024-09-12 19:52:47,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:52:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090906502] [2024-09-12 19:52:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:47,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:52:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:47,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:52:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:47,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:52:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:47,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:52:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:47,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-12 19:52:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:52:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:52:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090906502] [2024-09-12 19:52:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090906502] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:52:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031646535] [2024-09-12 19:52:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:52:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:52:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:52:47,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:52:47,359 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 19:52:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:52:47,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 19:52:47,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:52:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:52:47,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:52:47,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031646535] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:52:47,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:52:47,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2024-09-12 19:52:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666532613] [2024-09-12 19:52:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:52:47,476 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:52:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:52:47,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:52:47,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-09-12 19:52:47,477 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 19:52:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:52:47,545 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-09-12 19:52:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:52:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2024-09-12 19:52:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:52:47,545 INFO L225 Difference]: With dead ends: 30 [2024-09-12 19:52:47,545 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:52:47,546 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-09-12 19:52:47,546 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:52:47,547 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:52:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:52:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:52:47,548 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:52:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:52:47,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-12 19:52:47,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:52:47,549 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:52:47,549 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 19:52:47,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:52:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:52:47,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:52:47,552 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2024-09-12 19:52:47,553 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2024-09-12 19:52:47,553 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2024-09-12 19:52:47,554 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2024-09-12 19:52:47,554 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2024-09-12 19:52:47,554 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2024-09-12 19:52:47,554 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2024-09-12 19:52:47,554 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2024-09-12 19:52:47,554 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2024-09-12 19:52:47,554 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2024-09-12 19:52:47,555 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2024-09-12 19:52:47,555 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2024-09-12 19:52:47,555 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fibo1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2024-09-12 19:52:47,573 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 19:52:47,755 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 19:52:47,759 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:52:47,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:52:48,143 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 19:52:48,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 07:52:48 BoogieIcfgContainer [2024-09-12 19:52:48,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 19:52:48,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 19:52:48,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 19:52:48,161 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 19:52:48,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:52:43" (3/4) ... [2024-09-12 19:52:48,163 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 19:52:48,166 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 19:52:48,166 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 19:52:48,166 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2024-09-12 19:52:48,166 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2024-09-12 19:52:48,170 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 19:52:48,171 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 19:52:48,171 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 19:52:48,171 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 19:52:48,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 19:52:48,258 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 19:52:48,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 19:52:48,258 INFO L158 Benchmark]: Toolchain (without parser) took 5601.28ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 48.8MB in the beginning and 39.9MB in the end (delta: 8.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-09-12 19:52:48,258 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory was 33.2MB in the beginning and 33.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:52:48,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.47ms. Allocated memory is still 73.4MB. Free memory was 48.6MB in the beginning and 37.3MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 19:52:48,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.80ms. Allocated memory is still 73.4MB. Free memory was 37.3MB in the beginning and 36.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:52:48,259 INFO L158 Benchmark]: Boogie Preprocessor took 48.42ms. Allocated memory is still 73.4MB. Free memory was 36.1MB in the beginning and 52.5MB in the end (delta: -16.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-09-12 19:52:48,259 INFO L158 Benchmark]: RCFGBuilder took 384.45ms. Allocated memory is still 73.4MB. Free memory was 52.5MB in the beginning and 38.8MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 19:52:48,260 INFO L158 Benchmark]: TraceAbstraction took 4792.41ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 38.2MB in the beginning and 44.1MB in the end (delta: -6.0MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-09-12 19:52:48,260 INFO L158 Benchmark]: Witness Printer took 97.00ms. Allocated memory is still 107.0MB. Free memory was 44.1MB in the beginning and 39.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 19:52:48,264 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.11ms. Allocated memory is still 54.5MB. Free memory was 33.2MB in the beginning and 33.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.47ms. Allocated memory is still 73.4MB. Free memory was 48.6MB in the beginning and 37.3MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.80ms. Allocated memory is still 73.4MB. Free memory was 37.3MB in the beginning and 36.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.42ms. Allocated memory is still 73.4MB. Free memory was 36.1MB in the beginning and 52.5MB in the end (delta: -16.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * RCFGBuilder took 384.45ms. Allocated memory is still 73.4MB. Free memory was 52.5MB in the beginning and 38.8MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4792.41ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 38.2MB in the beginning and 44.1MB in the end (delta: -6.0MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Witness Printer took 97.00ms. Allocated memory is still 107.0MB. Free memory was 44.1MB in the beginning and 39.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: 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: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: 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 5 procedures, 56 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 1447 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1069 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 378 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=3, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 3 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 50/64 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 13 specifications checked. All of them hold - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Requires: (\old(n) <= 1) Ensures: (((\result == 1) && (\old(n) == 1)) || ((\result == 0) && (\old(n) <= 0))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Requires: (2 == \old(n)) Ensures: ((2 == \old(n)) && (\result == 1)) RESULT: Ultimate proved your program to be correct! [2024-09-12 19:52:48,295 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