./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.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 64261cdf4de80f70fe2d4ad7338f6b0821a851ad9c048667535af1ece80ec49c --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:09:56,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:09:56,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:09:56,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:09:56,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:09:56,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:09:56,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:09:56,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:09:56,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:09:56,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:09:56,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:09:56,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:09:56,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:09:56,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:09:56,571 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:09:56,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:09:56,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:09:56,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:09:56,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:09:56,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:09:56,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:09:56,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:09:56,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:09:56,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:09:56,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:09:56,573 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:09:56,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:09:56,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:09:56,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:09:56,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:09:56,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:09:56,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:09:56,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:09:56,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:09:56,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:09:56,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:09:56,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:09:56,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:09:56,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:09:56,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:09:56,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:09:56,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:09:56,581 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 -> 64261cdf4de80f70fe2d4ad7338f6b0821a851ad9c048667535af1ece80ec49c Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:09:56,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:09:56,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:09:56,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:09:56,876 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:09:56,876 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:09:56,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c [2024-09-11 20:09:58,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:09:58,467 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:09:58,468 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c [2024-09-11 20:09:58,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/56aec97c9/f1bee07f1dd542e0a27cfc20ba6299ec/FLAG6f3bbc673 [2024-09-11 20:09:58,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/56aec97c9/f1bee07f1dd542e0a27cfc20ba6299ec [2024-09-11 20:09:58,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:09:58,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:09:58,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:09:58,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:09:58,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:09:58,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:09:58" (1/1) ... [2024-09-11 20:09:58,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4bd42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:58, skipping insertion in model container [2024-09-11 20:09:58,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:09:58" (1/1) ... [2024-09-11 20:09:58,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:09:59,021 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c[537,550] [2024-09-11 20:09:59,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:09:59,068 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:09:59,080 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound50.c[537,550] [2024-09-11 20:09:59,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:09:59,101 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:09:59,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59 WrapperNode [2024-09-11 20:09:59,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:09:59,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:09:59,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:09:59,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:09:59,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,133 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-11 20:09:59,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:09:59,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:09:59,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:09:59,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:09:59,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 20:09:59,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:09:59,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:09:59,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:09:59,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:09:59,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:09:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:59,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:09:59,241 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:09:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:09:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:09:59,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:09:59,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:09:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:09:59,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:09:59,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:09:59,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:09:59,346 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:09:59,348 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:09:59,488 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:09:59,489 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:09:59,513 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:09:59,514 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 20:09:59,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:09:59 BoogieIcfgContainer [2024-09-11 20:09:59,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:09:59,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:09:59,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:09:59,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:09:59,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:09:58" (1/3) ... [2024-09-11 20:09:59,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3defae22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:09:59, skipping insertion in model container [2024-09-11 20:09:59,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (2/3) ... [2024-09-11 20:09:59,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3defae22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:09:59, skipping insertion in model container [2024-09-11 20:09:59,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:09:59" (3/3) ... [2024-09-11 20:09:59,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound50.c [2024-09-11 20:09:59,544 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:09:59,545 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:09:59,602 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:09:59,608 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;@54dfd28a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:09:59,608 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:09:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 20:09:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:09:59,621 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:59,621 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:59,622 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:59,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2024-09-11 20:09:59,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:59,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048734247] [2024-09-11 20:09:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:59,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:09:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:59,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:09:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:59,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:09:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:09:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:09:59,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048734247] [2024-09-11 20:09:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048734247] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:09:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:09:59,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:09:59,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637050580] [2024-09-11 20:09:59,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:09:59,828 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:09:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:09:59,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:09:59,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:09:59,849 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:09:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:59,884 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2024-09-11 20:09:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:09:59,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-11 20:09:59,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:59,894 INFO L225 Difference]: With dead ends: 58 [2024-09-11 20:09:59,894 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:09:59,897 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:09:59,900 INFO L434 NwaCegarLoop]: 38 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, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:09:59,901 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:09:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:09:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 20:09:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:09:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-09-11 20:09:59,938 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2024-09-11 20:09:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:09:59,939 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-09-11 20:09:59,940 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:09:59,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-09-11 20:09:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:09:59,946 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:59,946 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:59,946 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:09:59,946 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:59,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2024-09-11 20:09:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:59,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436101226] [2024-09-11 20:09:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:10:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:10:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:10:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:10:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:00,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436101226] [2024-09-11 20:10:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436101226] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:00,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643603167] [2024-09-11 20:10:00,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:00,289 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:00,294 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:10:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:00,377 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-09-11 20:10:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:00,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-11 20:10:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:00,379 INFO L225 Difference]: With dead ends: 41 [2024-09-11 20:10:00,379 INFO L226 Difference]: Without dead ends: 39 [2024-09-11 20:10:00,380 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:10:00,381 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:00,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:10:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-11 20:10:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-09-11 20:10:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:10:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-11 20:10:00,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2024-09-11 20:10:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:00,393 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-11 20:10:00,393 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:10:00,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-11 20:10:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:10:00,395 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:00,395 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:00,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:10:00,395 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:00,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2024-09-11 20:10:00,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:00,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686817559] [2024-09-11 20:10:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:10:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:10:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:10:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:10:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:10:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686817559] [2024-09-11 20:10:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686817559] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905738537] [2024-09-11 20:10:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:00,821 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:00,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:00,823 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:10:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:00,955 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-09-11 20:10:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:00,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-11 20:10:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:00,960 INFO L225 Difference]: With dead ends: 45 [2024-09-11 20:10:00,960 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 20:10:00,960 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:10:00,961 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:00,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:10:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 20:10:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-11 20:10:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:10:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-09-11 20:10:00,979 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2024-09-11 20:10:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:00,980 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-09-11 20:10:00,980 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:10:00,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-09-11 20:10:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 20:10:00,983 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:00,983 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:00,983 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:10:00,983 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:00,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2024-09-11 20:10:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:00,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499190421] [2024-09-11 20:10:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:01,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807137977] [2024-09-11 20:10:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:01,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:01,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:01,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:10:01,022 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:10:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:01,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-11 20:10:01,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 20:10:01,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:10:01,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:01,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499190421] [2024-09-11 20:10:01,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807137977] [2024-09-11 20:10:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807137977] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:01,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:01,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-11 20:10:01,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221568553] [2024-09-11 20:10:01,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:01,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 20:10:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:01,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 20:10:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:10:01,301 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:10:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:01,527 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-09-11 20:10:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:10:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-09-11 20:10:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:01,529 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:10:01,529 INFO L226 Difference]: Without dead ends: 49 [2024-09-11 20:10:01,529 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:10:01,530 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:01,531 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:10:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-11 20:10:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-11 20:10:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:10:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-09-11 20:10:01,556 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 33 [2024-09-11 20:10:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:01,556 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-09-11 20:10:01,556 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:10:01,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-09-11 20:10:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 20:10:01,557 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:01,558 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:01,576 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 20:10:01,758 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:01,759 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:01,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2024-09-11 20:10:01,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:01,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828400270] [2024-09-11 20:10:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909613278] [2024-09-11 20:10:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:01,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:01,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:10:01,798 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:10:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:01,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-11 20:10:01,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:10:02,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:10:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828400270] [2024-09-11 20:10:03,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909613278] [2024-09-11 20:10:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909613278] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:03,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:03,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-09-11 20:10:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872200259] [2024-09-11 20:10:03,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:03,071 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 20:10:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:03,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 20:10:03,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:10:03,073 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-11 20:10:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:03,578 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-09-11 20:10:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:10:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 40 [2024-09-11 20:10:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:03,584 INFO L225 Difference]: With dead ends: 67 [2024-09-11 20:10:03,584 INFO L226 Difference]: Without dead ends: 59 [2024-09-11 20:10:03,584 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:10:03,585 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:03,588 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:10:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-11 20:10:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-11 20:10:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 20:10:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-09-11 20:10:03,605 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 40 [2024-09-11 20:10:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:03,607 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-09-11 20:10:03,607 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-11 20:10:03,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-09-11 20:10:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:10:03,610 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:03,610 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:03,623 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-11 20:10:03,813 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:03,814 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:03,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2024-09-11 20:10:03,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:03,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748563841] [2024-09-11 20:10:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:03,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:03,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436912140] [2024-09-11 20:10:03,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:03,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:03,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:03,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:10:03,859 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:10:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:03,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 20:10:03,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-11 20:10:04,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-11 20:10:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748563841] [2024-09-11 20:10:04,206 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436912140] [2024-09-11 20:10:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436912140] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:10:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-09-11 20:10:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846953149] [2024-09-11 20:10:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:04,208 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:10:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:10:04,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:10:04,209 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-11 20:10:08,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:10:12,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:10:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:12,350 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-09-11 20:10:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2024-09-11 20:10:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:12,352 INFO L225 Difference]: With dead ends: 69 [2024-09-11 20:10:12,353 INFO L226 Difference]: Without dead ends: 67 [2024-09-11 20:10:12,353 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:10:12,354 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:12,354 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 110 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2024-09-11 20:10:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-11 20:10:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-09-11 20:10:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.1) internal successors, (44), 43 states have internal predecessors, (44), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-11 20:10:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2024-09-11 20:10:12,372 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 50 [2024-09-11 20:10:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:12,373 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2024-09-11 20:10:12,373 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-11 20:10:12,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-09-11 20:10:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-11 20:10:12,374 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:12,375 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:12,385 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 20:10:12,578 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:10:12,579 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:12,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 961839043, now seen corresponding path program 1 times [2024-09-11 20:10:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:12,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276274101] [2024-09-11 20:10:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:10:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:10:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:10:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:10:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:10:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:10:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:10:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:10:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:10:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:10:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:10:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-11 20:10:12,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:12,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276274101] [2024-09-11 20:10:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276274101] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562698712] [2024-09-11 20:10:12,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:12,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:12,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:12,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:10:12,773 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:10:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:12,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 20:10:12,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-09-11 20:10:12,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:12,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562698712] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:12,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2024-09-11 20:10:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37897775] [2024-09-11 20:10:12,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:12,979 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:10:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:10:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:10:12,980 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-11 20:10:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:13,318 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2024-09-11 20:10:13,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:10:13,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 68 [2024-09-11 20:10:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:13,320 INFO L225 Difference]: With dead ends: 98 [2024-09-11 20:10:13,320 INFO L226 Difference]: Without dead ends: 90 [2024-09-11 20:10:13,320 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:10:13,321 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:13,321 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:10:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-11 20:10:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-09-11 20:10:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-11 20:10:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-09-11 20:10:13,346 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 68 [2024-09-11 20:10:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:13,349 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-09-11 20:10:13,350 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 6 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-11 20:10:13,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2024-09-11 20:10:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-11 20:10:13,351 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:13,351 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:13,370 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:10:13,552 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:13,552 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:13,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2024-09-11 20:10:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838392384] [2024-09-11 20:10:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:13,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374251016] [2024-09-11 20:10:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:13,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:13,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:13,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:10:13,607 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 20:10:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:13,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-09-11 20:10:13,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 33 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-09-11 20:10:14,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:02,450 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:11:14,479 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~B~0#1| 2147483648)) (.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296))) (or (= .cse0 (mod (+ |c_ULTIMATE.start_main_~B~0#1| |c_ULTIMATE.start_main_~A~0#1| (* .cse1 4294967295)) 4294967296)) (< .cse0 (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296)) (< (* .cse1 2) (+ .cse0 1)))) is different from true [2024-09-11 20:11:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-09-11 20:11:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838392384] [2024-09-11 20:11:14,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374251016] [2024-09-11 20:11:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374251016] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:14,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2024-09-11 20:11:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546861511] [2024-09-11 20:11:14,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:14,774 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 20:11:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 20:11:14,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=410, Unknown=5, NotChecked=42, Total=552 [2024-09-11 20:11:14,776 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 19 states have internal predecessors, (38), 11 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 12 states have call predecessors, (22), 9 states have call successors, (22) [2024-09-11 20:11:22,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:43,606 WARN L293 SmtUtils]: Spent 20.63s on a formula simplification. DAG size of input: 41 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:11:47,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:51,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:54,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:11,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:15,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:19,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:23,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:27,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:31,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:35,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:13:27,884 WARN L293 SmtUtils]: Spent 45.83s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:13:31,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-11 20:13:35,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:13:39,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:13:43,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:13:47,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:06,145 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 45 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:14:07,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:12,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:14,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:20,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:25,262 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 []