./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 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_valuebound100.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 5bba06987e8c2f8236800dde4bec4c9d50f427f841de99efa853660259681b37 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-17 18:37:47,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:37:47,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 18:37:47,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:37:47,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:37:47,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:37:47,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:37:47,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:37:47,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:37:47,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:37:47,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:37:47,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:37:47,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:37:47,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:37:47,419 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:37:47,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:37:47,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:37:47,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:37:47,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 18:37:47,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:37:47,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:37:47,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:37:47,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:37:47,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:37:47,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:37:47,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:37:47,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:37:47,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:37:47,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:37:47,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:37:47,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:37:47,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:37:47,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:37:47,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:37:47,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:37:47,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:37:47,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 18:37:47,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 18:37:47,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:37:47,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:37:47,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:37:47,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:37:47,431 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 -> 5bba06987e8c2f8236800dde4bec4c9d50f427f841de99efa853660259681b37 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-17 18:37:47,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:37:47,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:37:47,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:37:47,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:37:47,718 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:37:47,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.c [2024-09-17 18:37:49,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:37:49,444 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:37:49,445 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.c [2024-09-17 18:37:49,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ea30b98c3/825f13504c15466c8bee372bdbbb8f3d/FLAG82d3b750d [2024-09-17 18:37:49,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ea30b98c3/825f13504c15466c8bee372bdbbb8f3d [2024-09-17 18:37:49,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:37:49,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:37:49,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:37:49,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:37:49,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:37:49,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f5607b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49, skipping insertion in model container [2024-09-17 18:37:49,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:37:49,646 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.c[525,538] [2024-09-17 18:37:49,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:37:49,706 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:37:49,725 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound100.c[525,538] [2024-09-17 18:37:49,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:37:49,786 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:37:49,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49 WrapperNode [2024-09-17 18:37:49,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:37:49,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:37:49,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:37:49,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:37:49,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,822 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:37:49,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:37:49,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:37:49,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:37:49,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:37:49,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,868 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-17 18:37:49,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:37:49,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:37:49,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:37:49,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:37:49,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (1/1) ... [2024-09-17 18:37:49,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:37:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:37:49,928 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-17 18:37:49,935 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-17 18:37:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:37:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 18:37:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 18:37:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:37:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:37:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 18:37:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:37:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:37:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:37:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:37:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 18:37:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 18:37:50,048 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:37:50,051 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:37:50,353 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-17 18:37:50,354 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:37:50,379 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:37:50,381 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-17 18:37:50,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:37:50 BoogieIcfgContainer [2024-09-17 18:37:50,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:37:50,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:37:50,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:37:50,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:37:50,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:37:49" (1/3) ... [2024-09-17 18:37:50,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3fb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:37:50, skipping insertion in model container [2024-09-17 18:37:50,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:37:49" (2/3) ... [2024-09-17 18:37:50,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3fb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:37:50, skipping insertion in model container [2024-09-17 18:37:50,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:37:50" (3/3) ... [2024-09-17 18:37:50,391 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound100.c [2024-09-17 18:37:50,409 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:37:50,410 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 18:37:50,475 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:37:50,483 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;@32cdca68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:37:50,484 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 18:37:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-17 18:37:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-17 18:37:50,496 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:37:50,497 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:37:50,498 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:37:50,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-17 18:37:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:37:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063315007] [2024-09-17 18:37:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:37:50,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:37:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:50,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:37:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:50,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:37:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:50,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-17 18:37:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:50,683 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-17 18:37:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:37:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063315007] [2024-09-17 18:37:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063315007] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:37:50,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:37:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-17 18:37:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903999288] [2024-09-17 18:37:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:37:50,698 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-17 18:37:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:37:50,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-17 18:37:50,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-17 18:37:50,722 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-17 18:37:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:37:50,757 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-17 18:37:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-17 18:37:50,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-17 18:37:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:37:50,767 INFO L225 Difference]: With dead ends: 66 [2024-09-17 18:37:50,768 INFO L226 Difference]: Without dead ends: 32 [2024-09-17 18:37:50,771 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-17 18:37:50,777 INFO L434 NwaCegarLoop]: 45 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, 45 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-17 18:37:50,780 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:37:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-17 18:37:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-17 18:37:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-17 18:37:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-17 18:37:50,818 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-17 18:37:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:37:50,819 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-17 18:37:50,819 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-17 18:37:50,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-17 18:37:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-17 18:37:50,822 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:37:50,822 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:37:50,822 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 18:37:50,822 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:37:50,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-17 18:37:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:37:50,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922014791] [2024-09-17 18:37:50,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:37:50,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:37:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:51,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:37:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:51,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:37:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:51,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-17 18:37:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:51,403 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-17 18:37:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:37:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922014791] [2024-09-17 18:37:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922014791] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:37:51,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:37:51,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:37:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877397128] [2024-09-17 18:37:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:37:51,410 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:37:51,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:37:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:37:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:37:51,414 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-17 18:37:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:37:51,721 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-17 18:37:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:37:51,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-17 18:37:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:37:51,724 INFO L225 Difference]: With dead ends: 64 [2024-09-17 18:37:51,725 INFO L226 Difference]: Without dead ends: 46 [2024-09-17 18:37:51,726 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-17 18:37:51,728 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 18:37:51,730 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 18:37:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-17 18:37:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-17 18:37:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-17 18:37:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-17 18:37:51,751 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-17 18:37:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:37:51,751 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-17 18:37:51,752 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-17 18:37:51,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-17 18:37:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-17 18:37:51,753 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:37:51,754 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:37:51,754 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 18:37:51,754 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:37:51,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-17 18:37:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:37:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465412159] [2024-09-17 18:37:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:37:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:37:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:52,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:37:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:52,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:37:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:52,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-17 18:37:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:52,105 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-17 18:37:52,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:37:52,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465412159] [2024-09-17 18:37:52,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465412159] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:37:52,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974524873] [2024-09-17 18:37:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:37:52,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:37:52,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:37:52,114 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-17 18:37:52,116 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-17 18:37:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:52,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-17 18:37:52,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:37:52,353 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-17 18:37:52,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:37:52,626 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-17 18:37:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974524873] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:37:52,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 18:37:52,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-17 18:37:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615537787] [2024-09-17 18:37:52,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 18:37:52,632 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-17 18:37:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:37:52,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-17 18:37:52,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-17 18:37:52,635 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-17 18:37:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:37:54,854 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-09-17 18:37:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-17 18:37:54,855 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-17 18:37:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:37:54,858 INFO L225 Difference]: With dead ends: 115 [2024-09-17 18:37:54,859 INFO L226 Difference]: Without dead ends: 97 [2024-09-17 18:37:54,860 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 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-17 18:37:54,862 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:37:54,863 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 304 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-09-17 18:37:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-17 18:37:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-09-17 18:37:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-17 18:37:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-09-17 18:37:54,885 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2024-09-17 18:37:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:37:54,885 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-09-17 18:37:54,886 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-17 18:37:54,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-09-17 18:37:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-17 18:37:54,887 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:37:54,888 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, 1, 1, 1, 1] [2024-09-17 18:37:54,906 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-17 18:37:55,091 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-17 18:37:55,092 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:37:55,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-17 18:37:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:37:55,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212128570] [2024-09-17 18:37:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:37:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:37:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 18:37:55,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37602770] [2024-09-17 18:37:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:37:55,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:37:55,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:37:55,139 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-17 18:37:55,141 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-17 18:37:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:55,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-17 18:37:55,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:37:55,256 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-17 18:37:55,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:37:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:37:55,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212128570] [2024-09-17 18:37:55,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 18:37:55,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37602770] [2024-09-17 18:37:55,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37602770] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:37:55,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:37:55,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:37:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560131525] [2024-09-17 18:37:55,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:37:55,262 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:37:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:37:55,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:37:55,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:37:55,263 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-17 18:37:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:37:55,446 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-09-17 18:37:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 18:37:55,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-17 18:37:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:37:55,450 INFO L225 Difference]: With dead ends: 90 [2024-09-17 18:37:55,450 INFO L226 Difference]: Without dead ends: 87 [2024-09-17 18:37:55,450 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-17 18:37:55,451 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 18:37:55,453 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 18:37:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-17 18:37:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-17 18:37:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-17 18:37:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-09-17 18:37:55,484 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 33 [2024-09-17 18:37:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:37:55,486 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-09-17 18:37:55,486 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-17 18:37:55,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-09-17 18:37:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-17 18:37:55,488 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:37:55,488 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, 1, 1, 1] [2024-09-17 18:37:55,506 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-17 18:37:55,689 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-17 18:37:55,690 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:37:55,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:37:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-17 18:37:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:37:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737310491] [2024-09-17 18:37:55,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:37:55,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:37:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 18:37:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935520836] [2024-09-17 18:37:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:37:55,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:37:55,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:37:55,711 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-17 18:37:55,713 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-17 18:37:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:37:55,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-17 18:37:55,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:37:55,938 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-17 18:37:55,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:37:59,537 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-17 18:37:59,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:37:59,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737310491] [2024-09-17 18:37:59,538 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 18:37:59,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935520836] [2024-09-17 18:37:59,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935520836] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:37:59,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 18:37:59,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-17 18:37:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55236250] [2024-09-17 18:37:59,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 18:37:59,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-17 18:37:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:37:59,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-17 18:37:59,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-17 18:37:59,541 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-17 18:38:12,182 WARN L293 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 29 DAG size of output: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-17 18:38:14,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-17 18:38:18,995 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-17 18:38:23,890 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-17 18:38:29,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-17 18:38:34,351 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-17 18:38:38,358 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-17 18:38:42,361 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-17 18:38:46,367 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-17 18:38:50,582 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-17 18:38:54,816 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-17 18:38:58,828 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-17 18:39:03,386 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-17 18:39:05,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-17 18:39:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:39:05,364 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-09-17 18:39:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:39:05,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-09-17 18:39:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:39:05,366 INFO L225 Difference]: With dead ends: 156 [2024-09-17 18:39:05,366 INFO L226 Difference]: Without dead ends: 132 [2024-09-17 18:39:05,367 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-17 18:39:05,368 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 56 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.3s IncrementalHoareTripleChecker+Time [2024-09-17 18:39:05,369 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 297 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 53.3s Time] [2024-09-17 18:39:05,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-09-17 18:39:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-09-17 18:39:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-17 18:39:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-09-17 18:39:05,425 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 32 [2024-09-17 18:39:05,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:39:05,425 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-09-17 18:39:05,426 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-17 18:39:05,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:39:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-09-17 18:39:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-17 18:39:05,428 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:39:05,429 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, 1, 1, 1, 1] [2024-09-17 18:39:05,436 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-17 18:39:05,629 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-17 18:39:05,630 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:39:05,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:39:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash -7962503, now seen corresponding path program 1 times [2024-09-17 18:39:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:39:05,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101720638] [2024-09-17 18:39:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:39:05,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:39:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 18:39:05,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128859330] [2024-09-17 18:39:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:39:05,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:39:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:39:05,685 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-17 18:39:05,688 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-17 18:39:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:05,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-17 18:39:05,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:39:05,916 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-17 18:39:05,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:39:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:39:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101720638] [2024-09-17 18:39:05,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 18:39:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128859330] [2024-09-17 18:39:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128859330] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:39:05,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:39:05,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-17 18:39:05,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28414643] [2024-09-17 18:39:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:39:05,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-17 18:39:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:39:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-17 18:39:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:39:05,920 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-17 18:39:07,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-17 18:39:11,227 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-17 18:39:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:39:11,356 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2024-09-17 18:39:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:39:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-09-17 18:39:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:39:11,359 INFO L225 Difference]: With dead ends: 140 [2024-09-17 18:39:11,359 INFO L226 Difference]: Without dead ends: 138 [2024-09-17 18:39:11,360 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-17 18:39:11,360 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-09-17 18:39:11,361 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 319 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-09-17 18:39:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-17 18:39:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-17 18:39:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 57 states have call successors, (57), 14 states have call predecessors, (57), 13 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-17 18:39:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2024-09-17 18:39:11,411 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 44 [2024-09-17 18:39:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:39:11,412 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2024-09-17 18:39:11,412 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-17 18:39:11,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:39:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2024-09-17 18:39:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-17 18:39:11,414 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:39:11,414 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, 1, 1, 1, 1] [2024-09-17 18:39:11,432 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-17 18:39:11,615 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-17 18:39:11,616 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:39:11,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:39:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-17 18:39:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:39:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382481381] [2024-09-17 18:39:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:39:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:39:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-17 18:39:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256739695] [2024-09-17 18:39:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:39:11,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:39:11,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:39:11,671 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-17 18:39:11,672 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-17 18:39:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:11,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-17 18:39:11,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:39:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-17 18:39:11,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:39:28,166 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-09-17 18:39:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:39:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382481381] [2024-09-17 18:39:28,173 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-17 18:39:28,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256739695] [2024-09-17 18:39:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256739695] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:39:28,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-17 18:39:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-17 18:39:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771281278] [2024-09-17 18:39:28,174 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-17 18:39:28,175 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-17 18:39:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:39:28,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-17 18:39:28,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-17 18:39:28,176 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-17 18:39:29,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-17 18:39:33,822 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-17 18:39:37,834 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-17 18:39:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:39:37,876 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2024-09-17 18:39:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 18:39:37,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-09-17 18:39:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:39:37,878 INFO L225 Difference]: With dead ends: 156 [2024-09-17 18:39:37,878 INFO L226 Difference]: Without dead ends: 138 [2024-09-17 18:39:37,879 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-17 18:39:37,879 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-09-17 18:39:37,879 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 146 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2024-09-17 18:39:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-17 18:39:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-17 18:39:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-17 18:39:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2024-09-17 18:39:37,914 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 59 [2024-09-17 18:39:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:39:37,915 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2024-09-17 18:39:37,915 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-17 18:39:37,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:39:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2024-09-17 18:39:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-17 18:39:37,920 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:39:37,920 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, 1, 1, 1, 1] [2024-09-17 18:39:37,933 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-17 18:39:38,121 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-17 18:39:38,122 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:39:38,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:39:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-17 18:39:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:39:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086469337] [2024-09-17 18:39:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:39:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:39:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,903 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:39:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:39:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,911 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-17 18:39:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-17 18:39:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-17 18:39:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-17 18:39:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-17 18:39:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-17 18:39:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:38,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-17 18:39:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:39,075 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-17 18:39:39,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:39:39,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086469337] [2024-09-17 18:39:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086469337] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:39:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190868174] [2024-09-17 18:39:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:39:39,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:39:39,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:39:39,078 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-17 18:39:39,079 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-17 18:39:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:39:39,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-17 18:39:39,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:39:39,908 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-17 18:39:39,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:40:08,724 WARN L293 SmtUtils]: Spent 16.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-17 18:40:12,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~q~0 4294967296))) (let ((.cse0 (div .cse1 4))) (or (< (mod c_main_~r~0 4294967296) (mod (+ c_main_~p~0 .cse0) 4294967296)) (< (mod (+ (* 4294967295 .cse0) c_main_~r~0 (* 4294967295 c_main_~p~0)) 4294967296) (mod (+ (* 4294967295 (mod c_main_~p~0 2)) (* 3 .cse0) c_main_~p~0) 4294967296)) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0) (* c_main_~q~0 c_main_~r~0 4 c_main_~h~0) (* c_main_~p~0 c_main_~h~0 c_main_~h~0) (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4) (* 4294967292 c_main_~q~0 c_main_~p~0 c_main_~r~0) (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0)) 4294967296) 0)) (= .cse1 1)))) is different from false [2024-09-17 18:40:25,082 WARN L293 SmtUtils]: Spent 8.04s 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-17 18:40:41,781 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-17 18:40:58,708 WARN L293 SmtUtils]: Spent 8.04s 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-17 18:41:11,378 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (mod c_main_~q~0 4294967296))) (or (let ((.cse11 (div .cse12 4))) (let ((.cse1 (mod (+ c_main_~p~0 .cse11) 4294967296)) (.cse9 (mod (+ (* 4294967295 .cse11) (* 4294967295 c_main_~p~0)) 4294967296)) (.cse7 (mod (+ (* 4294967295 (mod c_main_~p~0 2)) (* 3 .cse11) c_main_~p~0) 4294967296)) (.cse2 (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0)) (.cse3 (* c_main_~p~0 c_main_~h~0 c_main_~h~0)) (.cse4 (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4)) (.cse5 (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0)) (.cse8 (mod (+ (* 2 c_main_~p~0) c_main_~q~0) 4294967296))) (and (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse6 (+ v_z_14 .cse9)) (.cse0 (* v_y_14 4294967296))) (or (< (+ v_z_14 .cse0) .cse1) (not (= (mod (+ .cse2 (* v_z_14 c_main_~q~0 4 c_main_~h~0) (* 4294967292 v_z_14 c_main_~q~0 c_main_~p~0) .cse3 .cse4 .cse5) 4294967296) 0)) (< .cse6 .cse7) (< 4294967295 .cse6) (< .cse8 (+ v_z_14 .cse0 1)) (< v_z_14 0)))) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse10 (* v_y_14 4294967296))) (or (< (+ v_z_14 .cse10) .cse1) (< (+ v_z_14 .cse9) (+ 4294967296 .cse7)) (not (= (mod (+ .cse2 (* v_z_14 c_main_~q~0 4 c_main_~h~0) (* 4294967292 v_z_14 c_main_~q~0 c_main_~p~0) .cse3 .cse4 .cse5) 4294967296) 0)) (< 4294967295 v_z_14) (< .cse8 (+ v_z_14 .cse10 1)))))))) (= .cse12 1))) is different from false [2024-09-17 18:41:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190868174] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:41:11,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 18:41:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-09-17 18:41:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696913240] [2024-09-17 18:41:11,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 18:41:11,386 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-17 18:41:11,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:41:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-17 18:41:11,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=432, Unknown=3, NotChecked=86, Total=600 [2024-09-17 18:41:11,387 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-17 18:41:15,963 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-17 18:41:19,977 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-17 18:41:21,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-17 18:41:25,075 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-17 18:41:29,101 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-17 18:41:33,119 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-17 18:41:35,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-17 18:41:39,264 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-17 18:41:43,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-17 18:41:47,364 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-17 18:41:51,386 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-17 18:41:55,399 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-17 18:41:59,988 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-17 18:42:04,772 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-17 18:42:08,812 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-17 18:42:12,833 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-17 18:42:14,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-17 18:42:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:42:14,250 INFO L93 Difference]: Finished difference Result 182 states and 245 transitions. [2024-09-17 18:42:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-17 18:42:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 58 [2024-09-17 18:42:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:42:14,252 INFO L225 Difference]: With dead ends: 182 [2024-09-17 18:42:14,252 INFO L226 Difference]: Without dead ends: 151 [2024-09-17 18:42:14,252 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=116, Invalid=645, Unknown=3, NotChecked=106, Total=870 [2024-09-17 18:42:14,253 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 21 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.7s IncrementalHoareTripleChecker+Time [2024-09-17 18:42:14,253 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 434 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 421 Invalid, 14 Unknown, 0 Unchecked, 62.7s Time] [2024-09-17 18:42:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-09-17 18:42:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-09-17 18:42:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 78 states have (on average 1.1282051282051282) internal successors, (88), 80 states have internal predecessors, (88), 56 states have call successors, (56), 17 states have call predecessors, (56), 16 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-17 18:42:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2024-09-17 18:42:14,286 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 58 [2024-09-17 18:42:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:42:14,287 INFO L474 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2024-09-17 18:42:14,287 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-17 18:42:14,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:42:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2024-09-17 18:42:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-17 18:42:14,289 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:42:14,289 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, 1, 1, 1, 1] [2024-09-17 18:42:14,305 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-17 18:42:14,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-17 18:42:14,493 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:42:14,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:42:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1682429464, now seen corresponding path program 2 times [2024-09-17 18:42:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:42:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681218727] [2024-09-17 18:42:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:42:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:42:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:42:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:42:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-17 18:42:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 18:42:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 18:42:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 18:42:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-17 18:42:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-17 18:42:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-17 18:42:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:42:15,879 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-17 18:42:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:42:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681218727] [2024-09-17 18:42:15,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681218727] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:42:15,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327309431] [2024-09-17 18:42:15,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-17 18:42:15,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:42:15,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:42:15,882 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-17 18:42:15,883 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-17 18:42:16,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-17 18:42:16,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 18:42:16,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-09-17 18:42:16,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:42:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-17 18:42:21,648 INFO L327 TraceCheckSpWp]: Computing backward predicates...