./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_5-1.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 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:08:01,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:08:01,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:08:01,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:08:01,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:08:01,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:08:01,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:08:01,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:08:01,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:08:01,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:08:01,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:08:01,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:08:01,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:08:01,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:08:01,810 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:08:01,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:08:01,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:08:01,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:08:01,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:08:01,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:08:01,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:08:01,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:08:01,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:08:01,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:08:01,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:08:01,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:08:01,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:08:01,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:08:01,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:08:01,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:08:01,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:08:01,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:08:01,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:08:01,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:08:01,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:08:01,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:08:01,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:08:01,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:08:01,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:08:01,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:08:01,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:08:01,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:08:01,824 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 -> 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 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.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:08:02,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:08:02,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:08:02,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:08:02,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:08:02,132 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:08:02,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-09-25 00:08:03,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:08:03,850 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:08:03,851 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-09-25 00:08:03,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/155d68acd/c064003d389d425698b05e2a69412441/FLAG038880c59 [2024-09-25 00:08:04,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/155d68acd/c064003d389d425698b05e2a69412441 [2024-09-25 00:08:04,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:08:04,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:08:04,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:08:04,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:08:04,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:08:04,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5802767a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04, skipping insertion in model container [2024-09-25 00:08:04,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:08:04,423 WARN L248 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_5-1.c[946,959] [2024-09-25 00:08:04,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:08:04,437 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:08:04,452 WARN L248 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_5-1.c[946,959] [2024-09-25 00:08:04,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:08:04,470 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:08:04,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04 WrapperNode [2024-09-25 00:08:04,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:08:04,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:08:04,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:08:04,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:08:04,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,553 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:08:04,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:08:04,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:08:04,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:08:04,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:08:04,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,591 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-25 00:08:04,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:08:04,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:08:04,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:08:04,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:08:04,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (1/1) ... [2024-09-25 00:08:04,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:08:04,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:04,637 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-25 00:08:04,642 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-25 00:08:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:08:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:08:04,680 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:08:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:08:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-25 00:08:04,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-25 00:08:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-25 00:08:04,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-25 00:08:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:08:04,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:08:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:08:04,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:08:04,739 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:08:04,741 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:08:04,884 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-25 00:08:04,884 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:08:04,912 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:08:04,913 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:08:04,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:08:04 BoogieIcfgContainer [2024-09-25 00:08:04,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:08:04,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:08:04,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:08:04,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:08:04,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:08:04" (1/3) ... [2024-09-25 00:08:04,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141a6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:08:04, skipping insertion in model container [2024-09-25 00:08:04,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:08:04" (2/3) ... [2024-09-25 00:08:04,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141a6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:08:04, skipping insertion in model container [2024-09-25 00:08:04,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:08:04" (3/3) ... [2024-09-25 00:08:04,923 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2024-09-25 00:08:04,941 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:08:04,942 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:08:04,989 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:08:04,995 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;@9af5819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:08:04,996 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:08:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-25 00:08:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 00:08:05,006 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:05,007 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:05,007 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:05,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash -685851838, now seen corresponding path program 1 times [2024-09-25 00:08:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:05,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100429438] [2024-09-25 00:08:05,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:05,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,300 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-25 00:08:05,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:05,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100429438] [2024-09-25 00:08:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100429438] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:08:05,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:08:05,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:08:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878092017] [2024-09-25 00:08:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:08:05,309 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:08:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:08:05,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:08:05,338 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:08:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:05,433 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-25 00:08:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:08:05,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-25 00:08:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:05,443 INFO L225 Difference]: With dead ends: 44 [2024-09-25 00:08:05,443 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 00:08:05,446 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:08:05,449 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:05,450 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:08:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 00:08:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 00:08:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-25 00:08:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-25 00:08:05,502 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2024-09-25 00:08:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:05,502 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-25 00:08:05,502 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:08:05,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-25 00:08:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 00:08:05,504 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:05,504 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:05,505 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:08:05,505 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:05,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash 924954813, now seen corresponding path program 1 times [2024-09-25 00:08:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489404005] [2024-09-25 00:08:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,627 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-25 00:08:05,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:05,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489404005] [2024-09-25 00:08:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489404005] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:08:05,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:08:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:08:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628911873] [2024-09-25 00:08:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:08:05,630 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:08:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:05,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:08:05,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:08:05,633 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:08:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:05,710 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-09-25 00:08:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:08:05,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-09-25 00:08:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:05,712 INFO L225 Difference]: With dead ends: 36 [2024-09-25 00:08:05,713 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 00:08:05,713 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:08:05,715 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:05,716 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:08:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 00:08:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 00:08:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-25 00:08:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-25 00:08:05,728 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2024-09-25 00:08:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:05,728 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-25 00:08:05,729 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:08:05,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-25 00:08:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 00:08:05,731 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:05,731 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-25 00:08:05,731 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:08:05,732 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:05,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1782416332, now seen corresponding path program 1 times [2024-09-25 00:08:05,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325101556] [2024-09-25 00:08:05,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,942 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 00:08:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:08:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325101556] [2024-09-25 00:08:05,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325101556] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:05,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926289466] [2024-09-25 00:08:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:05,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:06,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:06,003 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-25 00:08:06,010 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-25 00:08:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:06,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:08:06,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:08:06,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:08:06,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926289466] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:06,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:06,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-09-25 00:08:06,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027272404] [2024-09-25 00:08:06,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:06,472 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:08:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:06,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:08:06,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:08:06,477 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-25 00:08:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:06,640 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-09-25 00:08:06,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:08:06,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2024-09-25 00:08:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:06,643 INFO L225 Difference]: With dead ends: 58 [2024-09-25 00:08:06,643 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 00:08:06,644 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-09-25 00:08:06,645 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:06,645 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 160 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:08:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 00:08:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-09-25 00:08:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 00:08:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-25 00:08:06,654 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2024-09-25 00:08:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:06,655 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-25 00:08:06,655 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-25 00:08:06,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-25 00:08:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 00:08:06,657 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:06,657 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-25 00:08:06,677 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:08:06,862 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:06,863 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:06,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash -836643613, now seen corresponding path program 1 times [2024-09-25 00:08:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:06,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137970932] [2024-09-25 00:08:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:06,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:06,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:08:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:07,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137970932] [2024-09-25 00:08:07,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137970932] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:07,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345026108] [2024-09-25 00:08:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:07,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:07,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:07,062 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-25 00:08:07,065 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-25 00:08:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:08:07,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:08:07,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:08:07,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345026108] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:07,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:07,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-09-25 00:08:07,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443356527] [2024-09-25 00:08:07,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:07,365 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:08:07,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:07,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:08:07,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:08:07,366 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 00:08:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:07,556 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-09-25 00:08:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:08:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Word has length 27 [2024-09-25 00:08:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:07,559 INFO L225 Difference]: With dead ends: 56 [2024-09-25 00:08:07,559 INFO L226 Difference]: Without dead ends: 52 [2024-09-25 00:08:07,560 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-25 00:08:07,561 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:07,561 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:08:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-25 00:08:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-09-25 00:08:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:08:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-09-25 00:08:07,575 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 27 [2024-09-25 00:08:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:07,575 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-09-25 00:08:07,576 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 00:08:07,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-09-25 00:08:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 00:08:07,578 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:07,578 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:07,598 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-25 00:08:07,778 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:07,779 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:07,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -925704228, now seen corresponding path program 1 times [2024-09-25 00:08:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:07,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125568729] [2024-09-25 00:08:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 00:08:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:08:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:08:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125568729] [2024-09-25 00:08:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125568729] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057963530] [2024-09-25 00:08:07,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:07,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:07,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:07,938 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-25 00:08:07,940 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-25 00:08:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:07,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:08:07,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:08:08,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:08:08,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057963530] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:08,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:08,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-09-25 00:08:08,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472474656] [2024-09-25 00:08:08,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:08,370 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 00:08:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:08,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 00:08:08,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-25 00:08:08,371 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 00:08:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:08,605 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2024-09-25 00:08:08,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 00:08:08,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) Word has length 39 [2024-09-25 00:08:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:08,609 INFO L225 Difference]: With dead ends: 112 [2024-09-25 00:08:08,609 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 00:08:08,610 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-25 00:08:08,611 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:08,611 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 200 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:08:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 00:08:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-09-25 00:08:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (30), 14 states have call predecessors, (30), 13 states have call successors, (30) [2024-09-25 00:08:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2024-09-25 00:08:08,632 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2024-09-25 00:08:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:08,633 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2024-09-25 00:08:08,633 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 00:08:08,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2024-09-25 00:08:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 00:08:08,638 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:08,639 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:08,656 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 00:08:08,840 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:08,840 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:08,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1261961157, now seen corresponding path program 1 times [2024-09-25 00:08:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:08,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723563988] [2024-09-25 00:08:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:08,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:08,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:08,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:08,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:09,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:09,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-25 00:08:09,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723563988] [2024-09-25 00:08:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723563988] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:09,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438086373] [2024-09-25 00:08:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:09,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:09,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:09,033 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-25 00:08:09,035 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-25 00:08:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:09,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:08:09,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:08:09,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:08:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438086373] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:09,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-09-25 00:08:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152023141] [2024-09-25 00:08:09,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:09,514 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 00:08:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 00:08:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-09-25 00:08:09,516 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 00:08:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:09,888 INFO L93 Difference]: Finished difference Result 182 states and 328 transitions. [2024-09-25 00:08:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 00:08:09,888 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) Word has length 40 [2024-09-25 00:08:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:09,891 INFO L225 Difference]: With dead ends: 182 [2024-09-25 00:08:09,891 INFO L226 Difference]: Without dead ends: 122 [2024-09-25 00:08:09,896 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:08:09,897 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:09,897 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 343 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:08:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-25 00:08:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2024-09-25 00:08:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.21875) internal successors, (78), 67 states have internal predecessors, (78), 23 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (64), 26 states have call predecessors, (64), 22 states have call successors, (64) [2024-09-25 00:08:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 165 transitions. [2024-09-25 00:08:09,929 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 165 transitions. Word has length 40 [2024-09-25 00:08:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:09,931 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 165 transitions. [2024-09-25 00:08:09,931 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 00:08:09,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 165 transitions. [2024-09-25 00:08:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 00:08:09,936 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:09,936 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:09,956 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:08:10,137 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:10,138 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:10,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1624375296, now seen corresponding path program 1 times [2024-09-25 00:08:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755101942] [2024-09-25 00:08:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 00:08:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-25 00:08:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755101942] [2024-09-25 00:08:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755101942] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969976353] [2024-09-25 00:08:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:10,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:10,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:10,405 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-25 00:08:10,407 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-25 00:08:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:10,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 00:08:10,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-25 00:08:10,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:08:11,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969976353] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:11,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:11,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 19 [2024-09-25 00:08:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656007574] [2024-09-25 00:08:11,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:11,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 00:08:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 00:08:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-09-25 00:08:11,087 INFO L87 Difference]: Start difference. First operand 103 states and 165 transitions. Second operand has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (18), 8 states have call predecessors, (18), 13 states have call successors, (18) [2024-09-25 00:08:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:11,506 INFO L93 Difference]: Finished difference Result 252 states and 489 transitions. [2024-09-25 00:08:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-25 00:08:11,506 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (18), 8 states have call predecessors, (18), 13 states have call successors, (18) Word has length 54 [2024-09-25 00:08:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:11,514 INFO L225 Difference]: With dead ends: 252 [2024-09-25 00:08:11,514 INFO L226 Difference]: Without dead ends: 155 [2024-09-25 00:08:11,515 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-09-25 00:08:11,516 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:11,517 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 348 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:08:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-09-25 00:08:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 112. [2024-09-25 00:08:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (67), 28 states have call predecessors, (67), 25 states have call successors, (67) [2024-09-25 00:08:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2024-09-25 00:08:11,566 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2024-09-25 00:08:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:11,567 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2024-09-25 00:08:11,567 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (18), 8 states have call predecessors, (18), 13 states have call successors, (18) [2024-09-25 00:08:11,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2024-09-25 00:08:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-25 00:08:11,572 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:11,572 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:11,591 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 00:08:11,773 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 00:08:11,774 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:11,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2073072172, now seen corresponding path program 1 times [2024-09-25 00:08:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:11,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515997989] [2024-09-25 00:08:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:11,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:11,869 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:11,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 00:08:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-09-25 00:08:12,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:12,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515997989] [2024-09-25 00:08:12,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515997989] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:12,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074802749] [2024-09-25 00:08:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:12,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:12,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:12,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:08:12,145 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 00:08:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:12,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:08:12,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 31 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-09-25 00:08:12,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-09-25 00:08:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074802749] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:12,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:12,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 19 [2024-09-25 00:08:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748920761] [2024-09-25 00:08:12,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:12,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 00:08:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 00:08:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-09-25 00:08:12,660 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2024-09-25 00:08:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:13,044 INFO L93 Difference]: Finished difference Result 254 states and 496 transitions. [2024-09-25 00:08:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 00:08:13,044 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) Word has length 82 [2024-09-25 00:08:13,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:13,047 INFO L225 Difference]: With dead ends: 254 [2024-09-25 00:08:13,047 INFO L226 Difference]: Without dead ends: 137 [2024-09-25 00:08:13,049 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-09-25 00:08:13,050 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:13,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 264 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:08:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-09-25 00:08:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2024-09-25 00:08:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 75 states have internal predecessors, (91), 25 states have call successors, (25), 13 states have call predecessors, (25), 14 states have return successors, (61), 25 states have call predecessors, (61), 24 states have call successors, (61) [2024-09-25 00:08:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 177 transitions. [2024-09-25 00:08:13,080 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 177 transitions. Word has length 82 [2024-09-25 00:08:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:13,081 INFO L474 AbstractCegarLoop]: Abstraction has 114 states and 177 transitions. [2024-09-25 00:08:13,081 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2024-09-25 00:08:13,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 177 transitions. [2024-09-25 00:08:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-09-25 00:08:13,088 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:13,088 INFO L216 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:13,108 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 00:08:13,289 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:13,289 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:13,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash 146808360, now seen corresponding path program 1 times [2024-09-25 00:08:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847025007] [2024-09-25 00:08:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,915 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:13,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-09-25 00:08:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 00:08:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 183 proven. 290 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-25 00:08:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847025007] [2024-09-25 00:08:14,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847025007] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327365992] [2024-09-25 00:08:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:14,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:14,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:14,258 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:08:14,259 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 00:08:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:14,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 00:08:14,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 92 proven. 230 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2024-09-25 00:08:14,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 92 proven. 238 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2024-09-25 00:08:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327365992] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:15,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 13] total 32 [2024-09-25 00:08:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039216019] [2024-09-25 00:08:15,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:15,605 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 00:08:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:15,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 00:08:15,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2024-09-25 00:08:15,607 INFO L87 Difference]: Start difference. First operand 114 states and 177 transitions. Second operand has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 20 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 20 states have call predecessors, (34), 20 states have call successors, (34) [2024-09-25 00:08:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:16,309 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2024-09-25 00:08:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-25 00:08:16,309 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 20 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 20 states have call predecessors, (34), 20 states have call successors, (34) Word has length 205 [2024-09-25 00:08:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:16,311 INFO L225 Difference]: With dead ends: 244 [2024-09-25 00:08:16,312 INFO L226 Difference]: Without dead ends: 116 [2024-09-25 00:08:16,314 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 453 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1987, Unknown=0, NotChecked=0, Total=2352 [2024-09-25 00:08:16,315 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:16,315 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 482 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 00:08:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-25 00:08:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2024-09-25 00:08:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (35), 17 states have call predecessors, (35), 18 states have call successors, (35) [2024-09-25 00:08:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-09-25 00:08:16,329 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 205 [2024-09-25 00:08:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:16,330 INFO L474 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-09-25 00:08:16,330 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 20 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 20 states have call predecessors, (34), 20 states have call successors, (34) [2024-09-25 00:08:16,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-09-25 00:08:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-09-25 00:08:16,332 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:16,332 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:16,350 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 00:08:16,532 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:16,533 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:16,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1761300740, now seen corresponding path program 2 times [2024-09-25 00:08:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:16,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311609641] [2024-09-25 00:08:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 00:08:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 79 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-09-25 00:08:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311609641] [2024-09-25 00:08:16,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311609641] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097236026] [2024-09-25 00:08:16,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:08:16,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:16,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:16,889 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:08:16,890 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 00:08:16,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:08:16,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:08:16,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:08:16,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-09-25 00:08:17,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-09-25 00:08:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097236026] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:17,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:17,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 19 [2024-09-25 00:08:17,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047589046] [2024-09-25 00:08:17,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:17,381 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 00:08:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:17,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 00:08:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-09-25 00:08:17,383 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) [2024-09-25 00:08:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:17,619 INFO L93 Difference]: Finished difference Result 194 states and 277 transitions. [2024-09-25 00:08:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 00:08:17,620 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) Word has length 95 [2024-09-25 00:08:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:17,622 INFO L225 Difference]: With dead ends: 194 [2024-09-25 00:08:17,622 INFO L226 Difference]: Without dead ends: 109 [2024-09-25 00:08:17,623 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-09-25 00:08:17,625 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:17,626 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 229 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:08:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-25 00:08:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2024-09-25 00:08:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 69 states have internal predecessors, (86), 20 states have call successors, (20), 15 states have call predecessors, (20), 12 states have return successors, (33), 18 states have call predecessors, (33), 19 states have call successors, (33) [2024-09-25 00:08:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2024-09-25 00:08:17,651 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 95 [2024-09-25 00:08:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:17,651 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2024-09-25 00:08:17,652 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) [2024-09-25 00:08:17,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-09-25 00:08:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-25 00:08:17,655 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:17,655 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:17,673 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 00:08:17,855 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:17,856 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:17,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash 719095213, now seen corresponding path program 3 times [2024-09-25 00:08:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547332183] [2024-09-25 00:08:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,334 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,422 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 00:08:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-25 00:08:18,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:18,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547332183] [2024-09-25 00:08:18,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547332183] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:18,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011551416] [2024-09-25 00:08:18,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:08:18,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:18,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:18,769 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:08:18,771 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 00:08:18,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-25 00:08:18,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:08:18,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-25 00:08:18,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-25 00:08:19,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-25 00:08:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011551416] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:19,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2024-09-25 00:08:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420881606] [2024-09-25 00:08:19,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:19,446 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-25 00:08:19,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:19,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-25 00:08:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2024-09-25 00:08:19,447 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (18), 18 states have call predecessors, (18), 5 states have call successors, (18) [2024-09-25 00:08:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:19,630 INFO L93 Difference]: Finished difference Result 137 states and 193 transitions. [2024-09-25 00:08:19,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-25 00:08:19,630 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (18), 18 states have call predecessors, (18), 5 states have call successors, (18) Word has length 109 [2024-09-25 00:08:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:19,632 INFO L225 Difference]: With dead ends: 137 [2024-09-25 00:08:19,632 INFO L226 Difference]: Without dead ends: 133 [2024-09-25 00:08:19,633 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2024-09-25 00:08:19,633 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:19,633 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1012 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:08:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-09-25 00:08:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2024-09-25 00:08:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 82 states have internal predecessors, (99), 23 states have call successors, (23), 15 states have call predecessors, (23), 17 states have return successors, (54), 26 states have call predecessors, (54), 22 states have call successors, (54) [2024-09-25 00:08:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-09-25 00:08:19,652 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 109 [2024-09-25 00:08:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:19,653 INFO L474 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-09-25 00:08:19,653 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (18), 18 states have call predecessors, (18), 5 states have call successors, (18) [2024-09-25 00:08:19,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-09-25 00:08:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-09-25 00:08:19,654 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:19,654 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:19,672 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 00:08:19,858 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 00:08:19,859 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:19,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1579294066, now seen corresponding path program 4 times [2024-09-25 00:08:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241864977] [2024-09-25 00:08:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:19,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:19,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:19,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-09-25 00:08:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 58 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-09-25 00:08:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:20,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241864977] [2024-09-25 00:08:20,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241864977] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:20,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714440571] [2024-09-25 00:08:20,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 00:08:20,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:20,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:20,201 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:08:20,202 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 00:08:20,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 00:08:20,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:08:20,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 00:08:20,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-09-25 00:08:20,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 57 proven. 63 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-09-25 00:08:20,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714440571] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:20,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 11] total 24 [2024-09-25 00:08:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591537117] [2024-09-25 00:08:20,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:20,972 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:08:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:20,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:08:20,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:08:20,973 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) [2024-09-25 00:08:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:21,299 INFO L93 Difference]: Finished difference Result 240 states and 354 transitions. [2024-09-25 00:08:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-25 00:08:21,300 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) Word has length 110 [2024-09-25 00:08:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:21,303 INFO L225 Difference]: With dead ends: 240 [2024-09-25 00:08:21,303 INFO L226 Difference]: Without dead ends: 129 [2024-09-25 00:08:21,306 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 240 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 00:08:21,307 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:21,307 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 308 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:08:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-25 00:08:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2024-09-25 00:08:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 78 states have (on average 1.205128205128205) internal successors, (94), 77 states have internal predecessors, (94), 22 states have call successors, (22), 15 states have call predecessors, (22), 15 states have return successors, (39), 23 states have call predecessors, (39), 21 states have call successors, (39) [2024-09-25 00:08:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 155 transitions. [2024-09-25 00:08:21,326 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 155 transitions. Word has length 110 [2024-09-25 00:08:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:21,327 INFO L474 AbstractCegarLoop]: Abstraction has 116 states and 155 transitions. [2024-09-25 00:08:21,327 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) [2024-09-25 00:08:21,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 155 transitions. [2024-09-25 00:08:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-09-25 00:08:21,330 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:21,330 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:21,349 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-25 00:08:21,531 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 00:08:21,531 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:21,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -273902236, now seen corresponding path program 1 times [2024-09-25 00:08:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:21,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140161677] [2024-09-25 00:08:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,890 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,903 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 00:08:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-09-25 00:08:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-09-25 00:08:21,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140161677] [2024-09-25 00:08:21,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140161677] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899589344] [2024-09-25 00:08:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:21,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:21,923 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:08:21,924 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 00:08:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:22,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 00:08:22,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 133 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-09-25 00:08:22,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 147 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-09-25 00:08:23,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899589344] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:23,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:23,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 24 [2024-09-25 00:08:23,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444112745] [2024-09-25 00:08:23,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:23,293 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:08:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:08:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:08:23,294 INFO L87 Difference]: Start difference. First operand 116 states and 155 transitions. Second operand has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 19 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 10 states have call predecessors, (32), 19 states have call successors, (32) [2024-09-25 00:08:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:23,602 INFO L93 Difference]: Finished difference Result 229 states and 318 transitions. [2024-09-25 00:08:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 00:08:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 19 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 10 states have call predecessors, (32), 19 states have call successors, (32) Word has length 123 [2024-09-25 00:08:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:23,604 INFO L225 Difference]: With dead ends: 229 [2024-09-25 00:08:23,605 INFO L226 Difference]: Without dead ends: 84 [2024-09-25 00:08:23,606 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 265 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-09-25 00:08:23,606 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:23,607 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 485 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:08:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-25 00:08:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-09-25 00:08:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 57 states have internal predecessors, (69), 15 states have call successors, (15), 14 states have call predecessors, (15), 10 states have return successors, (15), 12 states have call predecessors, (15), 14 states have call successors, (15) [2024-09-25 00:08:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-09-25 00:08:23,617 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 123 [2024-09-25 00:08:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:23,618 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-09-25 00:08:23,618 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 19 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 10 states have call predecessors, (32), 19 states have call successors, (32) [2024-09-25 00:08:23,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-09-25 00:08:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-25 00:08:23,620 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:08:23,620 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:23,638 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-25 00:08:23,820 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:23,820 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:08:23,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -543433254, now seen corresponding path program 5 times [2024-09-25 00:08:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:08:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561540236] [2024-09-25 00:08:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:08:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:08:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:23,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:08:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:23,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:08:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:23,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 00:08:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:08:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:08:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:08:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:08:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:08:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 92 proven. 147 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-25 00:08:24,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:08:24,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561540236] [2024-09-25 00:08:24,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561540236] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:08:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141396531] [2024-09-25 00:08:24,302 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 00:08:24,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:08:24,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:08:24,304 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:08:24,305 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-25 00:08:24,393 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-09-25 00:08:24,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:08:24,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 00:08:24,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:08:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 105 proven. 126 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-09-25 00:08:24,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:08:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 105 proven. 129 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-09-25 00:08:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141396531] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:08:25,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:08:25,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 15] total 32 [2024-09-25 00:08:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027115515] [2024-09-25 00:08:25,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:08:25,323 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 00:08:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:08:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 00:08:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2024-09-25 00:08:25,325 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 21 states have call successors, (32), 1 states have call predecessors, (32), 11 states have return successors, (35), 19 states have call predecessors, (35), 21 states have call successors, (35) [2024-09-25 00:08:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:08:25,673 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2024-09-25 00:08:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-25 00:08:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 21 states have call successors, (32), 1 states have call predecessors, (32), 11 states have return successors, (35), 19 states have call predecessors, (35), 21 states have call successors, (35) Word has length 136 [2024-09-25 00:08:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:08:25,675 INFO L225 Difference]: With dead ends: 89 [2024-09-25 00:08:25,675 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:08:25,676 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2024-09-25 00:08:25,676 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:08:25,676 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 313 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:08:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:08:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:08:25,677 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-25 00:08:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:08:25,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2024-09-25 00:08:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:08:25,678 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:08:25,678 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 21 states have call successors, (32), 1 states have call predecessors, (32), 11 states have return successors, (35), 19 states have call predecessors, (35), 21 states have call successors, (35) [2024-09-25 00:08:25,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:08:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:08:25,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:08:25,681 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:08:25,695 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-25 00:08:25,883 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 00:08:25,886 INFO L408 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:08:25,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:08:30,858 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:08:30,888 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 00:08:30,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:08:30 BoogieIcfgContainer [2024-09-25 00:08:30,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:08:30,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:08:30,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:08:30,891 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:08:30,891 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:08:04" (3/4) ... [2024-09-25 00:08:30,893 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:08:30,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:08:30,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:08:30,951 INFO L158 Benchmark]: Toolchain (without parser) took 26708.00ms. Allocated memory was 161.5MB in the beginning and 524.3MB in the end (delta: 362.8MB). Free memory was 95.0MB in the beginning and 233.3MB in the end (delta: -138.4MB). Peak memory consumption was 226.6MB. Max. memory is 16.1GB. [2024-09-25 00:08:30,952 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 113.2MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:08:30,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.55ms. Allocated memory is still 161.5MB. Free memory was 94.6MB in the beginning and 83.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 00:08:30,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.07ms. Allocated memory is still 161.5MB. Free memory was 83.5MB in the beginning and 134.5MB in the end (delta: -51.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 00:08:30,953 INFO L158 Benchmark]: Boogie Preprocessor took 46.77ms. Allocated memory is still 161.5MB. Free memory was 134.5MB in the beginning and 132.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:08:30,953 INFO L158 Benchmark]: RCFGBuilder took 310.45ms. Allocated memory is still 161.5MB. Free memory was 132.8MB in the beginning and 120.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:08:30,954 INFO L158 Benchmark]: TraceAbstraction took 25974.55ms. Allocated memory was 161.5MB in the beginning and 524.3MB in the end (delta: 362.8MB). Free memory was 119.6MB in the beginning and 236.5MB in the end (delta: -117.0MB). Peak memory consumption was 306.7MB. Max. memory is 16.1GB. [2024-09-25 00:08:30,954 INFO L158 Benchmark]: Witness Printer took 60.28ms. Allocated memory is still 524.3MB. Free memory was 236.5MB in the beginning and 233.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 00:08:30,959 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.23ms. Allocated memory is still 113.2MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.55ms. Allocated memory is still 161.5MB. Free memory was 94.6MB in the beginning and 83.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.07ms. Allocated memory is still 161.5MB. Free memory was 83.5MB in the beginning and 134.5MB in the end (delta: -51.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.77ms. Allocated memory is still 161.5MB. Free memory was 134.5MB in the beginning and 132.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.45ms. Allocated memory is still 161.5MB. Free memory was 132.8MB in the beginning and 120.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25974.55ms. Allocated memory was 161.5MB in the beginning and 524.3MB in the end (delta: 362.8MB). Free memory was 119.6MB in the beginning and 236.5MB in the end (delta: -117.0MB). Peak memory consumption was 306.7MB. Max. memory is 16.1GB. * Witness Printer took 60.28ms. Allocated memory is still 524.3MB. Free memory was 236.5MB in the beginning and 233.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 530 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 4517 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4076 mSDsCounter, 425 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4901 IncrementalHoareTripleChecker+Invalid, 5326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 425 mSolverCounterUnsat, 441 mSDtfsCounter, 4901 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2661 GetRequests, 2299 SyntacticMatches, 48 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=11, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 141 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 2119 NumberOfCodeBlocks, 2051 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3127 ConstructedInterpolants, 0 QuantifiedInterpolants, 5927 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2351 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 6168/8469 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 1 specifications checked. All of them hold - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Ensures: (((((\result == 1) && (n == 1)) || (\result == 0)) || (2 < n)) && ((((((2 == \result) && (3 == n)) || ((\result == 1) && (n == 1))) || ((3 == \result) && (n == 4))) || (4 < n)) || (n < 1))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: ((((\result == 0) || (1 < n)) || (n == 1)) && ((n != 1) || (\result == 1))) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:08:30,986 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