./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.c --full-output --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 a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.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 ec2a850a3cd9252437037b0e2bf289d9622078bb11b0dcb40fb1cb3d7147f7c5 --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-a9b967e-m [2024-09-11 19:44:46,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:44:46,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:44:46,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:44:46,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:44:46,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:44:46,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:44:46,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:44:46,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:44:46,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:44:46,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:44:46,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:44:46,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:44:46,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:44:46,375 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:44:46,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:44:46,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:44:46,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:44:46,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:44:46,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:44:46,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:44:46,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:44:46,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:44:46,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:44:46,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:44:46,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:44:46,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:44:46,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:44:46,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:44:46,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:44:46,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:44:46,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:44:46,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:44:46,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:44:46,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:44:46,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:44:46,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:44:46,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:44:46,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:44:46,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:44:46,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:44:46,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:44:46,386 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 -> ec2a850a3cd9252437037b0e2bf289d9622078bb11b0dcb40fb1cb3d7147f7c5 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-11 19:44:46,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:44:46,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:44:46,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:44:46,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:44:46,608 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:44:46,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.c [2024-09-11 19:44:47,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:44:48,000 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:44:48,000 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.c [2024-09-11 19:44:48,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/02720ef41/b60d9787020e408caa7ccc6a04bb3c6b/FLAG494924ee6 [2024-09-11 19:44:48,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/02720ef41/b60d9787020e408caa7ccc6a04bb3c6b [2024-09-11 19:44:48,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:44:48,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:44:48,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:44:48,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:44:48,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:44:48,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ac6d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48, skipping insertion in model container [2024-09-11 19:44:48,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:44:48,561 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/dijkstra-u_valuebound20.c[525,538] [2024-09-11 19:44:48,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:44:48,604 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:44:48,612 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/dijkstra-u_valuebound20.c[525,538] [2024-09-11 19:44:48,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:44:48,639 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:44:48,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48 WrapperNode [2024-09-11 19:44:48,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:44:48,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:44:48,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:44:48,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:44:48,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,666 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-09-11 19:44:48,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:44:48,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:44:48,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:44:48,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:44:48,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,688 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-11 19:44:48,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:44:48,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:44:48,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:44:48,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:44:48,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (1/1) ... [2024-09-11 19:44:48,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:44:48,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:44:48,729 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-11 19:44:48,731 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-11 19:44:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:44:48,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:44:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:44:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:44:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:44:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:44:48,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:44:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:44:48,818 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:44:48,820 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:44:48,986 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 19:44:48,986 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:44:49,007 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:44:49,008 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:44:49,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:44:49 BoogieIcfgContainer [2024-09-11 19:44:49,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:44:49,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:44:49,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:44:49,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:44:49,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:44:48" (1/3) ... [2024-09-11 19:44:49,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c368e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:44:49, skipping insertion in model container [2024-09-11 19:44:49,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:48" (2/3) ... [2024-09-11 19:44:49,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c368e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:44:49, skipping insertion in model container [2024-09-11 19:44:49,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:44:49" (3/3) ... [2024-09-11 19:44:49,031 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound20.c [2024-09-11 19:44:49,044 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:44:49,044 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:44:49,090 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:44:49,095 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;@4eb87601, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:44:49,095 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:44:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:44:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 19:44:49,104 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:49,105 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:49,105 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:49,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash -10312671, now seen corresponding path program 1 times [2024-09-11 19:44:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006339819] [2024-09-11 19:44:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:49,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:49,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:49,223 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-11 19:44:49,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:49,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006339819] [2024-09-11 19:44:49,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006339819] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:44:49,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:44:49,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:44:49,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685635854] [2024-09-11 19:44:49,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:44:49,229 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:44:49,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:44:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:44:49,247 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:44:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:44:49,275 INFO L93 Difference]: Finished difference Result 58 states and 102 transitions. [2024-09-11 19:44:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:44:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-11 19:44:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:44:49,283 INFO L225 Difference]: With dead ends: 58 [2024-09-11 19:44:49,283 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 19:44:49,285 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:44:49,287 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:44:49,288 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:44:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 19:44:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 19:44:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 19:44:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-09-11 19:44:49,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2024-09-11 19:44:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:44:49,314 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-09-11 19:44:49,315 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:44:49,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2024-09-11 19:44:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:44:49,316 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:49,316 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:49,316 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:44:49,316 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:49,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 763841584, now seen corresponding path program 1 times [2024-09-11 19:44:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121878591] [2024-09-11 19:44:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:49,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:49,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:49,735 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-11 19:44:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121878591] [2024-09-11 19:44:49,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121878591] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:44:49,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:44:49,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:44:49,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780003069] [2024-09-11 19:44:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:44:49,737 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:44:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:49,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:44:49,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:44:49,738 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:44:50,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:44:55,048 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-11 19:44:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:44:55,049 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2024-09-11 19:44:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:44:55,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-11 19:44:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:44:55,059 INFO L225 Difference]: With dead ends: 60 [2024-09-11 19:44:55,059 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 19:44:55,060 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:44:55,061 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:44:55,061 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 158 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-09-11 19:44:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 19:44:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 19:44:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 19:44:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-09-11 19:44:55,074 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2024-09-11 19:44:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:44:55,074 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-09-11 19:44:55,074 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:44:55,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-09-11 19:44:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:44:55,075 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:55,076 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:55,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:44:55,076 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:55,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -82339253, now seen corresponding path program 1 times [2024-09-11 19:44:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:55,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423737060] [2024-09-11 19:44:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:55,334 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:55,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:55,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:55,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423737060] [2024-09-11 19:44:55,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423737060] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:44:55,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843618865] [2024-09-11 19:44:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:55,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:44:55,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:44:55,348 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-11 19:44:55,349 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-11 19:44:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:55,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:44:55,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:44:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:55,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:44:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:55,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843618865] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:44:55,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:44:55,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-11 19:44:55,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962489045] [2024-09-11 19:44:55,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:44:55,694 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:44:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:44:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:44:55,696 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:45:01,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:45:05,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:45:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:05,251 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2024-09-11 19:45:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:45:05,251 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-11 19:45:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:05,254 INFO L225 Difference]: With dead ends: 111 [2024-09-11 19:45:05,254 INFO L226 Difference]: Without dead ends: 93 [2024-09-11 19:45:05,255 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-11 19:45:05,257 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 97 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:05,260 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 270 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 178 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-09-11 19:45:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-11 19:45:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2024-09-11 19:45:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-11 19:45:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-09-11 19:45:05,284 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 21 [2024-09-11 19:45:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:05,284 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-09-11 19:45:05,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:45:05,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-09-11 19:45:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-11 19:45:05,289 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:05,289 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:05,302 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-11 19:45:05,489 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:05,492 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:05,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash -93184560, now seen corresponding path program 1 times [2024-09-11 19:45:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:05,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904948730] [2024-09-11 19:45:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:45:05,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1267848950] [2024-09-11 19:45:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:05,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:05,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:05,521 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-11 19:45:05,523 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-11 19:45:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:05,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:45:05,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:45:05,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:45:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904948730] [2024-09-11 19:45:05,616 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:45:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267848950] [2024-09-11 19:45:05,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267848950] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:45:05,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:45:05,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:45:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476918449] [2024-09-11 19:45:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:45:05,617 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:45:05,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:05,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:45:05,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:45:05,618 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:45:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:05,688 INFO L93 Difference]: Finished difference Result 86 states and 123 transitions. [2024-09-11 19:45:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:45:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-11 19:45:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:05,689 INFO L225 Difference]: With dead ends: 86 [2024-09-11 19:45:05,689 INFO L226 Difference]: Without dead ends: 83 [2024-09-11 19:45:05,690 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-11 19:45:05,690 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:05,690 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:45:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-11 19:45:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-09-11 19:45:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-09-11 19:45:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-09-11 19:45:05,709 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 29 [2024-09-11 19:45:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:05,710 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-09-11 19:45:05,710 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:45:05,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-09-11 19:45:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 19:45:05,711 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:05,711 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:05,725 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:45:05,912 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-11 19:45:05,912 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:05,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash 471953405, now seen corresponding path program 1 times [2024-09-11 19:45:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:05,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092541349] [2024-09-11 19:45:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:05,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:45:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388340002] [2024-09-11 19:45:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:05,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:05,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:05,932 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-11 19:45:05,934 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-11 19:45:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:06,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 19:45:06,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:06,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:45:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092541349] [2024-09-11 19:45:07,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:45:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388340002] [2024-09-11 19:45:07,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388340002] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:45:07,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:45:07,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 19:45:07,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854527504] [2024-09-11 19:45:07,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:45:07,413 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:45:07,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:07,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:45:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:45:07,413 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 19:45:24,140 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-11 19:45:28,380 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-11 19:45:32,434 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-11 19:45:35,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:39,877 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-11 19:45:43,890 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-11 19:45:47,909 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-11 19:45:52,809 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-11 19:45:56,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:00,723 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-11 19:46:04,744 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-11 19:46:08,763 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-11 19:46:12,973 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-11 19:46:16,982 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-11 19:46:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:46:16,986 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2024-09-11 19:46:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:46:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-09-11 19:46:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:46:16,988 INFO L225 Difference]: With dead ends: 152 [2024-09-11 19:46:16,988 INFO L226 Difference]: Without dead ends: 128 [2024-09-11 19:46:16,989 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=38, Invalid=91, Unknown=3, NotChecked=0, Total=132 [2024-09-11 19:46:16,989 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 55 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.8s IncrementalHoareTripleChecker+Time [2024-09-11 19:46:16,989 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 187 Invalid, 12 Unknown, 0 Unchecked, 56.8s Time] [2024-09-11 19:46:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-09-11 19:46:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2024-09-11 19:46:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 60 states have internal predecessors, (68), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-11 19:46:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2024-09-11 19:46:17,013 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 28 [2024-09-11 19:46:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:46:17,014 INFO L474 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2024-09-11 19:46:17,014 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 19:46:17,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-09-11 19:46:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 19:46:17,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:46:17,015 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:46:17,021 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:46:17,215 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-11 19:46:17,216 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:46:17,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash -416609438, now seen corresponding path program 1 times [2024-09-11 19:46:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:46:17,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563666819] [2024-09-11 19:46:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:46:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:46:17,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502691406] [2024-09-11 19:46:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:17,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:46:17,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:46:17,240 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-11 19:46:17,241 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-11 19:46:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:17,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 19:46:17,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:46:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 19:46:17,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:46:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:46:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563666819] [2024-09-11 19:46:17,431 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:46:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502691406] [2024-09-11 19:46:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502691406] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:46:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:46:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-11 19:46:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201041316] [2024-09-11 19:46:17,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:46:17,431 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 19:46:17,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:46:17,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 19:46:17,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:46:17,433 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:46:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:46:17,824 INFO L93 Difference]: Finished difference Result 136 states and 187 transitions. [2024-09-11 19:46:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:46:17,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-09-11 19:46:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:46:17,827 INFO L225 Difference]: With dead ends: 136 [2024-09-11 19:46:17,827 INFO L226 Difference]: Without dead ends: 134 [2024-09-11 19:46:17,827 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:46:17,828 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:46:17,828 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 231 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 19:46:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-09-11 19:46:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-09-11 19:46:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 69 states have internal predecessors, (77), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-11 19:46:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 185 transitions. [2024-09-11 19:46:17,856 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 185 transitions. Word has length 40 [2024-09-11 19:46:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:46:17,857 INFO L474 AbstractCegarLoop]: Abstraction has 134 states and 185 transitions. [2024-09-11 19:46:17,857 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:46:17,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 185 transitions. [2024-09-11 19:46:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 19:46:17,859 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:46:17,859 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:46:17,872 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-11 19:46:18,061 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-11 19:46:18,061 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:46:18,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:18,061 INFO L85 PathProgramCache]: Analyzing trace with hash -208842498, now seen corresponding path program 1 times [2024-09-11 19:46:18,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:46:18,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613791674] [2024-09-11 19:46:18,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:46:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:46:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998265058] [2024-09-11 19:46:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:18,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:46:18,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:46:18,092 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-11 19:46:18,093 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-11 19:46:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:18,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-11 19:46:18,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:46:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-11 19:46:18,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:46:30,705 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:46:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-11 19:46:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:46:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613791674] [2024-09-11 19:46:53,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:46:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998265058] [2024-09-11 19:46:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998265058] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:46:53,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:46:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-09-11 19:46:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001530384] [2024-09-11 19:46:53,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:46:53,095 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:46:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:46:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:46:53,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=80, Unknown=1, NotChecked=0, Total=110 [2024-09-11 19:46:53,096 INFO L87 Difference]: Start difference. First operand 134 states and 185 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-11 19:46:57,217 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-11 19:47:01,252 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-11 19:47:05,542 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-11 19:47:09,665 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-11 19:47:13,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:47:17,749 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-11 19:47:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:47:17,789 INFO L93 Difference]: Finished difference Result 152 states and 212 transitions. [2024-09-11 19:47:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:47:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 55 [2024-09-11 19:47:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:47:17,791 INFO L225 Difference]: With dead ends: 152 [2024-09-11 19:47:17,791 INFO L226 Difference]: Without dead ends: 134 [2024-09-11 19:47:17,791 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=36, Invalid=95, Unknown=1, NotChecked=0, Total=132 [2024-09-11 19:47:17,792 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 37 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2024-09-11 19:47:17,792 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 112 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 117 Invalid, 6 Unknown, 0 Unchecked, 24.7s Time] [2024-09-11 19:47:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-09-11 19:47:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-09-11 19:47:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-11 19:47:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2024-09-11 19:47:17,810 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 55 [2024-09-11 19:47:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:47:17,810 INFO L474 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2024-09-11 19:47:17,810 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-11 19:47:17,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:47:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2024-09-11 19:47:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-11 19:47:17,812 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:47:17,812 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:47:17,826 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 19:47:18,012 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-11 19:47:18,013 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:47:18,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:47:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2119770422, now seen corresponding path program 1 times [2024-09-11 19:47:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:47:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280578062] [2024-09-11 19:47:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:47:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:47:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:47:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:47:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:47:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 19:47:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:47:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:47:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 19:47:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 19:47:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-11 19:47:18,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:47:18,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280578062] [2024-09-11 19:47:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280578062] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:47:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392775441] [2024-09-11 19:47:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:47:18,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:47:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:47:18,819 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-11 19:47:18,820 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-11 19:47:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:18,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 19:47:18,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:47:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-11 19:47:19,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:47:37,353 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:47:37,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392775441] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:47:37,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:47:37,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2024-09-11 19:47:37,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570620306] [2024-09-11 19:47:37,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:47:37,355 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 19:47:37,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:47:37,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 19:47:37,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=391, Unknown=1, NotChecked=0, Total=462 [2024-09-11 19:47:37,356 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-09-11 19:47:41,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:47:46,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:47:50,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:47:51,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:47:55,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:47:58,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:02,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:06,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:10,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:15,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:19,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:23,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:27,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:31,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:48:35,236 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-11 19:48:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:48:35,254 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2024-09-11 19:48:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 19:48:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 54 [2024-09-11 19:48:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:48:35,256 INFO L225 Difference]: With dead ends: 178 [2024-09-11 19:48:35,256 INFO L226 Difference]: Without dead ends: 147 [2024-09-11 19:48:35,257 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=104, Invalid=597, Unknown=1, NotChecked=0, Total=702 [2024-09-11 19:48:35,257 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 21 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.7s IncrementalHoareTripleChecker+Time [2024-09-11 19:48:35,257 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 337 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 341 Invalid, 13 Unknown, 0 Unchecked, 57.7s Time] [2024-09-11 19:48:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-09-11 19:48:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-09-11 19:48:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 77 states have (on average 1.12987012987013) internal successors, (87), 79 states have internal predecessors, (87), 54 states have call successors, (54), 15 states have call predecessors, (54), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-11 19:48:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 193 transitions. [2024-09-11 19:48:35,288 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 193 transitions. Word has length 54 [2024-09-11 19:48:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:48:35,288 INFO L474 AbstractCegarLoop]: Abstraction has 147 states and 193 transitions. [2024-09-11 19:48:35,288 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-09-11 19:48:35,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:48:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 193 transitions. [2024-09-11 19:48:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-11 19:48:35,292 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:48:35,292 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:48:35,304 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-11 19:48:35,492 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-11 19:48:35,493 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:48:35,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:48:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash -806436145, now seen corresponding path program 2 times [2024-09-11 19:48:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:48:35,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343506125] [2024-09-11 19:48:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:48:35,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:48:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:48:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:48:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:48:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 19:48:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 19:48:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-11 19:48:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-11 19:48:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-11 19:48:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:48:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-11 19:48:36,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:48:36,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343506125] [2024-09-11 19:48:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343506125] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:48:36,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861558644] [2024-09-11 19:48:36,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:48:36,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:48:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:48:36,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:48:36,169 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 19:48:36,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:48:36,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:48:36,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 19:48:36,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:48:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-11 19:48:37,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:48:49,683 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:49:10,246 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:49:26,768 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)