./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.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 9d96fce9cba7910d867f13bc16c5bd69d4168f707f39f60b6964bcaea0f2a9ec --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 01:02:12,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 01:02:12,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 01:02:12,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 01:02:12,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 01:02:12,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 01:02:12,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 01:02:12,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 01:02:12,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 01:02:12,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 01:02:12,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 01:02:12,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 01:02:12,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 01:02:12,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 01:02:12,160 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 01:02:12,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 01:02:12,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 01:02:12,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 01:02:12,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 01:02:12,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 01:02:12,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 01:02:12,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 01:02:12,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 01:02:12,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 01:02:12,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 01:02:12,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 01:02:12,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 01:02:12,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 01:02:12,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 01:02:12,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 01:02:12,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 01:02:12,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 01:02:12,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:02:12,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 01:02:12,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 01:02:12,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 01:02:12,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 01:02:12,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 01:02:12,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 01:02:12,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 01:02:12,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 01:02:12,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 01:02:12,169 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 -> 9d96fce9cba7910d867f13bc16c5bd69d4168f707f39f60b6964bcaea0f2a9ec 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 [2024-09-13 01:02:12,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 01:02:12,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 01:02:12,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 01:02:12,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 01:02:12,432 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 01:02:12,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c [2024-09-13 01:02:13,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 01:02:14,037 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 01:02:14,037 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c [2024-09-13 01:02:14,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/00683e423/f2580d0110bc4eb4ac293f58146af3d8/FLAGd7b61aa63 [2024-09-13 01:02:14,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/00683e423/f2580d0110bc4eb4ac293f58146af3d8 [2024-09-13 01:02:14,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 01:02:14,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 01:02:14,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 01:02:14,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 01:02:14,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 01:02:14,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c750f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14, skipping insertion in model container [2024-09-13 01:02:14,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 01:02:14,605 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c[546,559] [2024-09-13 01:02:14,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:02:14,627 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 01:02:14,638 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c[546,559] [2024-09-13 01:02:14,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:02:14,657 INFO L204 MainTranslator]: Completed translation [2024-09-13 01:02:14,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14 WrapperNode [2024-09-13 01:02:14,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 01:02:14,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 01:02:14,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 01:02:14,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 01:02:14,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,690 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 01:02:14,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 01:02:14,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 01:02:14,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 01:02:14,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 01:02:14,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,713 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-13 01:02:14,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 01:02:14,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 01:02:14,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 01:02:14,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 01:02:14,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (1/1) ... [2024-09-13 01:02:14,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:02:14,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:02:14,768 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-13 01:02:14,772 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-13 01:02:14,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 01:02:14,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 01:02:14,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 01:02:14,816 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 01:02:14,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 01:02:14,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 01:02:14,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 01:02:14,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 01:02:14,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 01:02:14,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 01:02:14,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 01:02:14,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 01:02:14,883 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 01:02:14,885 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 01:02:15,032 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-13 01:02:15,032 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 01:02:15,049 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 01:02:15,050 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 01:02:15,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:02:15 BoogieIcfgContainer [2024-09-13 01:02:15,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 01:02:15,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 01:02:15,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 01:02:15,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 01:02:15,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:02:14" (1/3) ... [2024-09-13 01:02:15,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193c1ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:02:15, skipping insertion in model container [2024-09-13 01:02:15,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:14" (2/3) ... [2024-09-13 01:02:15,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193c1ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:02:15, skipping insertion in model container [2024-09-13 01:02:15,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:02:15" (3/3) ... [2024-09-13 01:02:15,060 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound5.c [2024-09-13 01:02:15,075 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 01:02:15,076 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 01:02:15,134 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 01:02:15,144 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;@2a0962ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 01:02:15,144 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 01:02:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 01:02:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 01:02:15,158 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:15,159 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:02:15,160 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:15,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:15,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1666515900, now seen corresponding path program 1 times [2024-09-13 01:02:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:15,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213874458] [2024-09-13 01:02:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:15,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:15,353 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:02:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:15,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:02:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:15,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:02:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213874458] [2024-09-13 01:02:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213874458] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:02:15,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:02:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 01:02:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044256953] [2024-09-13 01:02:15,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:02:15,405 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 01:02:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 01:02:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 01:02:15,422 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 01:02:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:02:15,503 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 01:02:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 01:02:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-13 01:02:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:02:15,513 INFO L225 Difference]: With dead ends: 51 [2024-09-13 01:02:15,513 INFO L226 Difference]: Without dead ends: 25 [2024-09-13 01:02:15,515 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 01:02:15,518 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:02:15,519 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:02:15,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-13 01:02:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-09-13 01:02:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 01:02:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-13 01:02:15,575 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2024-09-13 01:02:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:02:15,577 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-13 01:02:15,577 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 01:02:15,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-13 01:02:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 01:02:15,582 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:15,582 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:02:15,583 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 01:02:15,583 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:15,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -387848543, now seen corresponding path program 1 times [2024-09-13 01:02:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747779914] [2024-09-13 01:02:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:02:15,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242663504] [2024-09-13 01:02:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:15,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:15,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:02:15,646 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-13 01:02:15,650 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-13 01:02:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:15,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 01:02:15,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:02:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:15,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:02:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:15,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747779914] [2024-09-13 01:02:15,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:02:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242663504] [2024-09-13 01:02:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242663504] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:02:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:02:15,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:02:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029542396] [2024-09-13 01:02:15,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:02:15,806 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:02:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:15,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:02:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:02:15,807 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 01:02:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:02:15,860 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-13 01:02:15,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:02:15,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-09-13 01:02:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:02:15,862 INFO L225 Difference]: With dead ends: 35 [2024-09-13 01:02:15,862 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 01:02:15,862 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:02:15,863 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:02:15,863 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:02:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 01:02:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-13 01:02:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 01:02:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-13 01:02:15,875 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2024-09-13 01:02:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:02:15,877 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-13 01:02:15,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 01:02:15,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-13 01:02:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 01:02:15,878 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:15,878 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] [2024-09-13 01:02:15,891 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 01:02:16,079 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:16,079 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:16,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:16,080 INFO L85 PathProgramCache]: Analyzing trace with hash 783720481, now seen corresponding path program 1 times [2024-09-13 01:02:16,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:16,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223943287] [2024-09-13 01:02:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:02:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:02:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:02:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:16,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:16,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223943287] [2024-09-13 01:02:16,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223943287] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:02:16,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:02:16,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:02:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942485386] [2024-09-13 01:02:16,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:02:16,225 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:02:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:16,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:02:16,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:02:16,226 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 01:02:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:02:16,308 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-09-13 01:02:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 01:02:16,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-13 01:02:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:02:16,312 INFO L225 Difference]: With dead ends: 39 [2024-09-13 01:02:16,312 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 01:02:16,313 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:02:16,314 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:02:16,315 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:02:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 01:02:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 01:02:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 01:02:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-13 01:02:16,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2024-09-13 01:02:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:02:16,326 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-13 01:02:16,326 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 01:02:16,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-13 01:02:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 01:02:16,328 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:16,328 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:02:16,328 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 01:02:16,329 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:16,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1293449266, now seen corresponding path program 1 times [2024-09-13 01:02:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090192131] [2024-09-13 01:02:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:02:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:02:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:02:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 01:02:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:16,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090192131] [2024-09-13 01:02:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090192131] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:02:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116209304] [2024-09-13 01:02:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:16,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:02:16,712 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-13 01:02:16,713 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-13 01:02:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:16,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 01:02:16,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:02:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:16,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:02:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116209304] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:02:17,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:02:17,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2024-09-13 01:02:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832480252] [2024-09-13 01:02:17,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:02:17,155 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 01:02:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 01:02:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-13 01:02:17,159 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:02:21,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:02:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:02:21,550 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-13 01:02:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 01:02:21,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2024-09-13 01:02:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:02:21,551 INFO L225 Difference]: With dead ends: 45 [2024-09-13 01:02:21,552 INFO L226 Difference]: Without dead ends: 39 [2024-09-13 01:02:21,552 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-13 01:02:21,553 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-09-13 01:02:21,553 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 101 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-09-13 01:02:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-13 01:02:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-13 01:02:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 01:02:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-13 01:02:21,564 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2024-09-13 01:02:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:02:21,564 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-13 01:02:21,564 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:02:21,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-13 01:02:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-13 01:02:21,565 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:21,565 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:02:21,582 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-13 01:02:21,766 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-13 01:02:21,766 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:21,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1959775791, now seen corresponding path program 1 times [2024-09-13 01:02:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:21,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296579346] [2024-09-13 01:02:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:02:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422121270] [2024-09-13 01:02:21,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:21,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:02:21,809 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-13 01:02:21,811 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-13 01:02:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:21,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-13 01:02:21,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:02:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 01:02:22,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:02:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 10 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 01:02:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:35,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296579346] [2024-09-13 01:02:35,619 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:02:35,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422121270] [2024-09-13 01:02:35,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422121270] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:02:35,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:02:35,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-09-13 01:02:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956740785] [2024-09-13 01:02:35,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:02:35,620 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-13 01:02:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:35,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-13 01:02:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=166, Unknown=3, NotChecked=0, Total=210 [2024-09-13 01:02:35,622 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 01:02:37,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:02:46,731 WARN L293 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:02:50,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:06,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:10,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:14,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:18,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:22,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:26,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:47,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:51,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:55,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:59,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:03,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:07,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:11,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:15,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:19,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:23,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:27,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:04:27,190 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-09-13 01:04:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 01:04:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 38 [2024-09-13 01:04:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:04:27,193 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:04:27,193 INFO L226 Difference]: Without dead ends: 64 [2024-09-13 01:04:27,193 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 50.8s TimeCoverageRelationStatistics Valid=74, Invalid=259, Unknown=9, NotChecked=0, Total=342 [2024-09-13 01:04:27,194 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 12 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.8s IncrementalHoareTripleChecker+Time [2024-09-13 01:04:27,194 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 214 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 73.8s Time] [2024-09-13 01:04:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-13 01:04:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-09-13 01:04:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:04:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-09-13 01:04:27,223 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 38 [2024-09-13 01:04:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:04:27,224 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-09-13 01:04:27,224 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 01:04:27,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:04:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-09-13 01:04:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 01:04:27,225 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:04:27,226 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-13 01:04:27,246 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 01:04:27,426 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-13 01:04:27,427 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:04:27,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:04:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash -701383951, now seen corresponding path program 1 times [2024-09-13 01:04:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:04:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394289300] [2024-09-13 01:04:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:04:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:04:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:27,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:04:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:27,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:04:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:27,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:04:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:27,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 01:04:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:27,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-13 01:04:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 01:04:27,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:04:27,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394289300] [2024-09-13 01:04:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394289300] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:04:27,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852439723] [2024-09-13 01:04:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:04:27,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:04:27,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:04:27,586 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-13 01:04:27,587 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-13 01:04:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:27,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 01:04:27,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:04:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:04:27,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:04:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 01:04:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852439723] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:04:27,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:04:27,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-09-13 01:04:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559577898] [2024-09-13 01:04:27,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:04:27,782 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 01:04:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:04:27,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 01:04:27,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-09-13 01:04:27,784 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 8 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-13 01:04:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:04:27,993 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-09-13 01:04:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-13 01:04:27,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 8 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 39 [2024-09-13 01:04:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:04:27,997 INFO L225 Difference]: With dead ends: 75 [2024-09-13 01:04:27,997 INFO L226 Difference]: Without dead ends: 67 [2024-09-13 01:04:27,998 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-09-13 01:04:27,998 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:04:27,999 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 47 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:04:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-13 01:04:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-13 01:04:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.065217391304348) internal successors, (49), 48 states have internal predecessors, (49), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:04:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-09-13 01:04:28,031 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 39 [2024-09-13 01:04:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:04:28,032 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-09-13 01:04:28,032 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 8 states have call successors, (18), 7 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-13 01:04:28,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:04:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-09-13 01:04:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-13 01:04:28,037 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:04:28,037 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:04:28,056 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 01:04:28,238 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-13 01:04:28,238 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:04:28,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:04:28,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1794971433, now seen corresponding path program 2 times [2024-09-13 01:04:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:04:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568967956] [2024-09-13 01:04:28,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:04:28,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:04:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:04:28,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1687573214] [2024-09-13 01:04:28,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:04:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:04:28,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:04:28,309 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-13 01:04:28,311 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-13 01:04:28,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:04:28,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:04:28,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-13 01:04:28,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:04:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-09-13 01:04:28,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:05:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 10 proven. 0 refuted. 50 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-13 01:05:51,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:05:51,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568967956] [2024-09-13 01:05:51,026 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:05:51,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687573214] [2024-09-13 01:05:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687573214] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:05:51,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:05:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2024-09-13 01:05:51,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359282661] [2024-09-13 01:05:51,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:05:51,027 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 01:05:51,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:05:51,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 01:05:51,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=322, Unknown=16, NotChecked=0, Total=420 [2024-09-13 01:05:51,029 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 14 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-13 01:05:55,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-13 01:05:59,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:06:29,447 WARN L293 SmtUtils]: Spent 24.38s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:06:33,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:02,391 WARN L293 SmtUtils]: Spent 16.88s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:07:06,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:10,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:14,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:18,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:22,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:26,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:07,623 WARN L293 SmtUtils]: Spent 20.72s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:08:11,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:15,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:19,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:23,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:28,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:32,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:36,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:40,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:44,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:48,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:52,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:32,542 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:09:36,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:40,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:44,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:48,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:52,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:56,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:00,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:04,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:08,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:12,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:16,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:20,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:24,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:28,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:32,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:36,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:17,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:21,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:25,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:29,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:33,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:37,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:41,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:45,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:49,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:53,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:57,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:01,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:05,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:09,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:13,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:17,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:21,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:25,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:29,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:33,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:37,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:19,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:23,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:27,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:31,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:35,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:39,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:43,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:47,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:51,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:55,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:59,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:03,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:07,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:11,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:15,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:19,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:23,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:27,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:31,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:35,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:39,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:43,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:47,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:51,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:55,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:59,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:15:00,082 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2024-09-13 01:15:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-13 01:15:00,083 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 14 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) Word has length 63 [2024-09-13 01:15:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:15:00,085 INFO L225 Difference]: With dead ends: 107 [2024-09-13 01:15:00,085 INFO L226 Difference]: Without dead ends: 96 [2024-09-13 01:15:00,086 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 287.4s TimeCoverageRelationStatistics Valid=176, Invalid=533, Unknown=47, NotChecked=0, Total=756 [2024-09-13 01:15:00,087 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 27 mSolverCounterUnsat, 83 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 334.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 83 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 335.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:15:00,087 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 374 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 258 Invalid, 83 Unknown, 0 Unchecked, 335.0s Time] [2024-09-13 01:15:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-13 01:15:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-09-13 01:15:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 69 states have internal predecessors, (69), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-13 01:15:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-09-13 01:15:00,125 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 63 [2024-09-13 01:15:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:15:00,125 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-09-13 01:15:00,125 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 14 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-13 01:15:00,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:15:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-09-13 01:15:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-09-13 01:15:00,128 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:15:00,128 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:15:00,142 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-13 01:15:00,331 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-13 01:15:00,331 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:15:00,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:15:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1945237055, now seen corresponding path program 2 times [2024-09-13 01:15:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:15:00,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044726531] [2024-09-13 01:15:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:15:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:15:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:15:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:15:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:15:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 01:15:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-13 01:15:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-13 01:15:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 01:15:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:15:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-13 01:15:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 01:15:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 01:15:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-13 01:15:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-13 01:15:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 01:15:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,091 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-13 01:15:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:15:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 289 proven. 35 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-09-13 01:15:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:15:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044726531] [2024-09-13 01:15:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044726531] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:15:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160982298] [2024-09-13 01:15:01,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:15:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:15:01,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:15:01,103 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-13 01:15:01,106 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-13 01:15:01,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:15:01,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:15:01,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 01:15:01,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:15:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 394 proven. 5 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-09-13 01:15:01,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:15:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 228 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-09-13 01:15:01,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160982298] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:15:01,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:15:01,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 20 [2024-09-13 01:15:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471383976] [2024-09-13 01:15:01,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:15:01,537 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-13 01:15:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:15:01,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-13 01:15:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2024-09-13 01:15:01,538 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 19 states have internal predecessors, (80), 16 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) [2024-09-13 01:15:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:15:01,860 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2024-09-13 01:15:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-13 01:15:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 19 states have internal predecessors, (80), 16 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) Word has length 118 [2024-09-13 01:15:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:15:01,862 INFO L225 Difference]: With dead ends: 99 [2024-09-13 01:15:01,862 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 01:15:01,863 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 258 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2024-09-13 01:15:01,865 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:15:01,865 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 01:15:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 01:15:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 01:15:01,867 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-13 01:15:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 01:15:01,867 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2024-09-13 01:15:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:15:01,867 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 01:15:01,868 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 19 states have internal predecessors, (80), 16 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 15 states have call predecessors, (27), 16 states have call successors, (27) [2024-09-13 01:15:01,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:15:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 01:15:01,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 01:15:01,870 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 01:15:01,889 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-13 01:15:02,071 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-13 01:15:02,074 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-09-13 01:15:02,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 01:15:07,398 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 79 DAG size of output: 55 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 01:15:26,324 WARN L293 SmtUtils]: Spent 18.84s on a formula simplification. DAG size of input: 70 DAG size of output: 17 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 01:15:31,362 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 67 DAG size of output: 43 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 01:15:39,931 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 73 DAG size of output: 49 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 01:15:48,287 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 67 DAG size of output: 43 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-13 01:15:48,290 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 01:15:48,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 01:15:48 BoogieIcfgContainer [2024-09-13 01:15:48,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 01:15:48,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 01:15:48,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 01:15:48,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 01:15:48,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:02:15" (3/4) ... [2024-09-13 01:15:48,312 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 01:15:48,314 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 01:15:48,315 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 01:15:48,315 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 01:15:48,315 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 01:15:48,318 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-09-13 01:15:48,318 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-13 01:15:48,318 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 01:15:48,318 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 01:15:48,341 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(counter) == 0) && (((((((((y == ((__int128) ((long long) z * z) * z)) && (1 <= z)) && (x == ((((long long) z * z) + z) + 1))) && (counter == 2)) || ((((y == ((((__int128) ((long long) z * z) * z) * z) * z)) && (counter == 4)) && ((((((((__int128) ((long long) z * z) * z) * z) + ((long long) z * z)) + z) + ((__int128) ((long long) z * z) * z)) + 1) == x)) && (1 <= z))) || ((((1 <= z) && (counter == 1)) && (((long long) z * z) == y)) && (x == ((long long) z + 1)))) || ((((counter == 3) && (x == (((((long long) z * z) + z) + ((__int128) ((long long) z * z) * z)) + 1))) && ((((__int128) ((long long) z * z) * z) * z) == y)) && (1 <= z))) || ((((z == y) && (x == 1)) && (counter == 0)) && (1 <= z))) || (((((((((__int128) ((long long) z * z) * z) * z) * z) * z) == y) && (1 <= z)) && (((((((((__int128) ((long long) z * z) * z) * z) + ((long long) z * z)) + z) + ((__int128) ((long long) z * z) * z)) + ((((__int128) ((long long) z * z) * z) * z) * z)) + 1) == x)) && (5 <= counter)))) [2024-09-13 01:15:48,404 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 01:15:48,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 01:15:48,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 01:15:48,406 INFO L158 Benchmark]: Toolchain (without parser) took 813967.80ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 93.8MB in the beginning and 149.4MB in the end (delta: -55.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 01:15:48,406 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 01:15:48,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.00ms. Allocated memory is still 163.6MB. Free memory was 93.6MB in the beginning and 82.1MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 01:15:48,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.61ms. Allocated memory is still 163.6MB. Free memory was 82.1MB in the beginning and 135.7MB in the end (delta: -53.6MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-09-13 01:15:48,407 INFO L158 Benchmark]: Boogie Preprocessor took 41.64ms. Allocated memory is still 163.6MB. Free memory was 135.7MB in the beginning and 134.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 01:15:48,407 INFO L158 Benchmark]: RCFGBuilder took 316.54ms. Allocated memory is still 163.6MB. Free memory was 134.0MB in the beginning and 120.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 01:15:48,409 INFO L158 Benchmark]: TraceAbstraction took 813256.88ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 120.2MB in the beginning and 153.6MB in the end (delta: -33.4MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-09-13 01:15:48,409 INFO L158 Benchmark]: Witness Printer took 96.17ms. Allocated memory is still 209.7MB. Free memory was 153.6MB in the beginning and 149.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 01:15:48,410 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.19ms. Allocated memory is still 163.6MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.00ms. Allocated memory is still 163.6MB. Free memory was 93.6MB in the beginning and 82.1MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.61ms. Allocated memory is still 163.6MB. Free memory was 82.1MB in the beginning and 135.7MB in the end (delta: -53.6MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.64ms. Allocated memory is still 163.6MB. Free memory was 135.7MB in the beginning and 134.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 316.54ms. Allocated memory is still 163.6MB. Free memory was 134.0MB in the beginning and 120.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 813256.88ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 120.2MB in the beginning and 153.6MB in the end (delta: -33.4MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * Witness Printer took 96.17ms. Allocated memory is still 209.7MB. Free memory was 153.6MB in the beginning and 149.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 767.0s, OverallIterations: 8, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 665.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 102 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 413.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 996 SdHoareTripleChecker+Invalid, 413.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 845 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1033 IncrementalHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 151 mSDtfsCounter, 1033 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 726 GetRequests, 602 SyntacticMatches, 13 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 338.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=7, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 98.6s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 811 ConstructedInterpolants, 1 QuantifiedInterpolants, 2927 SizeOfPredicates, 14 NumberOfNonLiveVariables, 913 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 1919/2118 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 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((\old(counter) == 0) && (((((((((y == ((__int128) ((long long) z * z) * z)) && (1 <= z)) && (x == ((((long long) z * z) + z) + 1))) && (counter == 2)) || ((((y == ((((__int128) ((long long) z * z) * z) * z) * z)) && (counter == 4)) && ((((((((__int128) ((long long) z * z) * z) * z) + ((long long) z * z)) + z) + ((__int128) ((long long) z * z) * z)) + 1) == x)) && (1 <= z))) || ((((1 <= z) && (counter == 1)) && (((long long) z * z) == y)) && (x == ((long long) z + 1)))) || ((((counter == 3) && (x == (((((long long) z * z) + z) + ((__int128) ((long long) z * z) * z)) + 1))) && ((((__int128) ((long long) z * z) * z) * z) == y)) && (1 <= z))) || ((((z == y) && (x == 1)) && (counter == 0)) && (1 <= z))) || (((((((((__int128) ((long long) z * z) * z) * z) * z) * z) == y) && (1 <= z)) && (((((((((__int128) ((long long) z * z) * z) * z) + ((long long) z * z)) + z) + ((__int128) ((long long) z * z) * z)) + ((((__int128) ((long long) z * z) * z) * z) * z)) + 1) == x)) && (5 <= counter)))) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((\old(cond) != 0) && (counter == 0)) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-13 01:15:48,626 WARN L435 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-09-13 01:15:48,633 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE