./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound50.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_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 a3c408aeb75b378569a9828f29f37caa03495bee0afeec4c4af831c79f34806f --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 01:51:43,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 01:51:43,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 01:51:43,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 01:51:43,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 01:51:43,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 01:51:43,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 01:51:43,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 01:51:43,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 01:51:43,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 01:51:43,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 01:51:43,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 01:51:43,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 01:51:43,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 01:51:43,850 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 01:51:43,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 01:51:43,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 01:51:43,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 01:51:43,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 01:51:43,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 01:51:43,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 01:51:43,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 01:51:43,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 01:51:43,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 01:51:43,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 01:51:43,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 01:51:43,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 01:51:43,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 01:51:43,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 01:51:43,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 01:51:43,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 01:51:43,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 01:51:43,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:51:43,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 01:51:43,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 01:51:43,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 01:51:43,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 01:51:43,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 01:51:43,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 01:51:43,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 01:51:43,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 01:51:43,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 01:51:43,857 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 -> a3c408aeb75b378569a9828f29f37caa03495bee0afeec4c4af831c79f34806f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 01:51:44,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 01:51:44,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 01:51:44,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 01:51:44,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 01:51:44,058 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 01:51:44,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound50.c [2024-09-13 01:51:45,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 01:51:45,351 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 01:51:45,352 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound50.c [2024-09-13 01:51:45,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/05addcb44/76bc8b113bb0420387cf0dcc1c7cbd81/FLAGbeb7ff09d [2024-09-13 01:51:45,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/05addcb44/76bc8b113bb0420387cf0dcc1c7cbd81 [2024-09-13 01:51:45,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 01:51:45,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 01:51:45,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 01:51:45,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 01:51:45,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 01:51:45,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a0c09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45, skipping insertion in model container [2024-09-13 01:51:45,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 01:51:45,540 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-ll_valuebound50.c[538,551] [2024-09-13 01:51:45,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:51:45,571 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 01:51:45,579 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-ll_valuebound50.c[538,551] [2024-09-13 01:51:45,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:51:45,631 INFO L204 MainTranslator]: Completed translation [2024-09-13 01:51:45,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45 WrapperNode [2024-09-13 01:51:45,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 01:51:45,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 01:51:45,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 01:51:45,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 01:51:45,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,650 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 01:51:45,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 01:51:45,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 01:51:45,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 01:51:45,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 01:51:45,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,684 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 01:51:45,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 01:51:45,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 01:51:45,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 01:51:45,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 01:51:45,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (1/1) ... [2024-09-13 01:51:45,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:51:45,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:45,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 01:51:45,737 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 01:51:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 01:51:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 01:51:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 01:51:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 01:51:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 01:51:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 01:51:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 01:51:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 01:51:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 01:51:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 01:51:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 01:51:45,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 01:51:45,813 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 01:51:45,814 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 01:51:45,937 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 01:51:45,937 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 01:51:45,951 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 01:51:45,951 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 01:51:45,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:51:45 BoogieIcfgContainer [2024-09-13 01:51:45,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 01:51:45,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 01:51:45,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 01:51:45,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 01:51:45,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:51:45" (1/3) ... [2024-09-13 01:51:45,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338a132b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:51:45, skipping insertion in model container [2024-09-13 01:51:45,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:51:45" (2/3) ... [2024-09-13 01:51:45,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338a132b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:51:45, skipping insertion in model container [2024-09-13 01:51:45,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:51:45" (3/3) ... [2024-09-13 01:51:45,957 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound50.c [2024-09-13 01:51:45,969 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 01:51:45,969 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 01:51:46,013 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 01:51:46,018 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;@55afa56a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 01:51:46,018 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 01:51:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-13 01:51:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 01:51:46,026 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:46,027 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:51:46,027 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:46,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-13 01:51:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507910084] [2024-09-13 01:51:46,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:46,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:51:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:51:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:51:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:51:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,154 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-13 01:51:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507910084] [2024-09-13 01:51:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507910084] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:51:46,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:51:46,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 01:51:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735456585] [2024-09-13 01:51:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:51:46,160 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 01:51:46,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 01:51:46,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 01:51:46,177 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 01:51:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:46,202 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-13 01:51:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 01:51:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-13 01:51:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:46,209 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:51:46,209 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 01:51:46,211 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-13 01:51:46,213 INFO L434 NwaCegarLoop]: 44 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, 44 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-13 01:51:46,214 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:51:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 01:51:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 01:51:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:51:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-13 01:51:46,242 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-13 01:51:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:46,243 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-13 01:51:46,243 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 01:51:46,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-13 01:51:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 01:51:46,246 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:46,246 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:51:46,246 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 01:51:46,246 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:46,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-13 01:51:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:46,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357507857] [2024-09-13 01:51:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:51:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:51:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:51:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:51:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,428 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-13 01:51:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357507857] [2024-09-13 01:51:46,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357507857] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:51:46,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:51:46,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:51:46,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946774382] [2024-09-13 01:51:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:51:46,431 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:51:46,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:51:46,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:51:46,432 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 01:51:46,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:46,499 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-13 01:51:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:51:46,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-13 01:51:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:46,501 INFO L225 Difference]: With dead ends: 45 [2024-09-13 01:51:46,501 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 01:51:46,501 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:51:46,502 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:46,502 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:51:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 01:51:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-13 01:51:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:51:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-13 01:51:46,510 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-13 01:51:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:46,511 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-13 01:51:46,511 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 01:51:46,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-13 01:51:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 01:51:46,512 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:46,512 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, 1, 1, 1, 1] [2024-09-13 01:51:46,512 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 01:51:46,513 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:46,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-13 01:51:46,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:46,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027678790] [2024-09-13 01:51:46,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:46,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:51:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:51:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:51:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:51:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:51:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,684 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-13 01:51:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:46,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027678790] [2024-09-13 01:51:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027678790] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:51:46,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:51:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:51:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041868973] [2024-09-13 01:51:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:51:46,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:51:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:51:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:51:46,688 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:51:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:46,757 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-13 01:51:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:51:46,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-13 01:51:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:46,760 INFO L225 Difference]: With dead ends: 49 [2024-09-13 01:51:46,760 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 01:51:46,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:51:46,761 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:46,761 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:51:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 01:51:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-13 01:51:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:51:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-13 01:51:46,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-13 01:51:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:46,772 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-13 01:51:46,772 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:51:46,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-13 01:51:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 01:51:46,773 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:46,774 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, 1, 1, 1, 1] [2024-09-13 01:51:46,774 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 01:51:46,775 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:46,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-13 01:51:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:46,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754552107] [2024-09-13 01:51:46,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:51:46,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430174265] [2024-09-13 01:51:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:46,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:46,805 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 01:51:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:46,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 01:51:46,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 01:51:46,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:51:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754552107] [2024-09-13 01:51:46,927 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:51:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430174265] [2024-09-13 01:51:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430174265] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:51:46,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:51:46,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:51:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275510424] [2024-09-13 01:51:46,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:51:46,929 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:51:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:46,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:51:46,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:51:46,934 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 01:51:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:46,999 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-13 01:51:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:51:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-13 01:51:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:47,001 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:51:47,003 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 01:51:47,003 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:51:47,004 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:47,004 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:51:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 01:51:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 01:51:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-13 01:51:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-13 01:51:47,018 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-13 01:51:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:47,018 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-13 01:51:47,018 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 01:51:47,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-13 01:51:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 01:51:47,021 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:47,021 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, 1, 1, 1, 1] [2024-09-13 01:51:47,035 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 01:51:47,225 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-13 01:51:47,226 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:47,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-13 01:51:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:47,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912659619] [2024-09-13 01:51:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:47,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:51:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212304543] [2024-09-13 01:51:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:47,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:47,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:47,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:47,244 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 01:51:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:47,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 01:51:47,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 01:51:47,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:51:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 01:51:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912659619] [2024-09-13 01:51:47,551 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:51:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212304543] [2024-09-13 01:51:47,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212304543] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:51:47,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:51:47,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-13 01:51:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717880467] [2024-09-13 01:51:47,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:51:47,552 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 01:51:47,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:47,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 01:51:47,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-13 01:51:47,553 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 01:51:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:47,659 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-09-13 01:51:47,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 01:51:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-09-13 01:51:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:47,661 INFO L225 Difference]: With dead ends: 68 [2024-09-13 01:51:47,662 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 01:51:47,662 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-13 01:51:47,662 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:47,663 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:51:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 01:51:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-13 01:51:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 01:51:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-09-13 01:51:47,686 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-09-13 01:51:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:47,687 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-09-13 01:51:47,687 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 01:51:47,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-09-13 01:51:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 01:51:47,688 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:47,688 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, 1, 1, 1, 1] [2024-09-13 01:51:47,710 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 01:51:47,892 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-13 01:51:47,893 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:47,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-13 01:51:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390022126] [2024-09-13 01:51:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:51:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105825933] [2024-09-13 01:51:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:47,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:47,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:47,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:47,929 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 01:51:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:47,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 01:51:47,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:48,052 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-13 01:51:48,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:51:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-13 01:51:48,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390022126] [2024-09-13 01:51:48,141 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:51:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105825933] [2024-09-13 01:51:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105825933] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 01:51:48,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 01:51:48,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-13 01:51:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668301151] [2024-09-13 01:51:48,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:51:48,143 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:51:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:51:48,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 01:51:48,144 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-13 01:51:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:48,224 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-09-13 01:51:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:51:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-09-13 01:51:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:48,229 INFO L225 Difference]: With dead ends: 73 [2024-09-13 01:51:48,229 INFO L226 Difference]: Without dead ends: 71 [2024-09-13 01:51:48,229 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-13 01:51:48,230 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:48,231 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:51:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-13 01:51:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-13 01:51:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-13 01:51:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-09-13 01:51:48,259 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-09-13 01:51:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:48,259 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-09-13 01:51:48,260 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-13 01:51:48,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-09-13 01:51:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-13 01:51:48,263 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:48,263 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:51:48,275 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 01:51:48,463 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-13 01:51:48,464 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:48,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-09-13 01:51:48,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:48,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698249382] [2024-09-13 01:51:48,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:48,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:51:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:51:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:51:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,574 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:51:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:51:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:51:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:51:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:51:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:51:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-13 01:51:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 01:51:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698249382] [2024-09-13 01:51:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698249382] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:51:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:51:48,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:51:48,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59893702] [2024-09-13 01:51:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:51:48,616 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:51:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:48,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:51:48,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:51:48,620 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 01:51:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:48,674 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-09-13 01:51:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:51:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-09-13 01:51:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:48,675 INFO L225 Difference]: With dead ends: 78 [2024-09-13 01:51:48,677 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 01:51:48,677 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:51:48,677 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:48,678 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:51:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 01:51:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-13 01:51:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 01:51:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-09-13 01:51:48,693 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-09-13 01:51:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:48,694 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-09-13 01:51:48,695 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 01:51:48,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-09-13 01:51:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-13 01:51:48,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:48,698 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, 1, 1, 1, 1] [2024-09-13 01:51:48,698 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 01:51:48,698 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:48,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:48,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-13 01:51:48,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:48,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351521599] [2024-09-13 01:51:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:51:48,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762846211] [2024-09-13 01:51:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:48,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:48,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:48,718 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:48,719 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 01:51:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:48,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-13 01:51:48,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-13 01:51:49,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:51:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 01:51:50,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:50,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351521599] [2024-09-13 01:51:50,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:51:50,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762846211] [2024-09-13 01:51:50,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762846211] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:51:50,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:51:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-09-13 01:51:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687422405] [2024-09-13 01:51:50,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:51:50,567 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-13 01:51:50,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-13 01:51:50,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-09-13 01:51:50,571 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2024-09-13 01:51:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:51,491 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2024-09-13 01:51:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-13 01:51:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 74 [2024-09-13 01:51:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:51,493 INFO L225 Difference]: With dead ends: 153 [2024-09-13 01:51:51,493 INFO L226 Difference]: Without dead ends: 130 [2024-09-13 01:51:51,494 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2024-09-13 01:51:51,494 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 79 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:51,494 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 256 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 01:51:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-13 01:51:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2024-09-13 01:51:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-13 01:51:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2024-09-13 01:51:51,534 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 74 [2024-09-13 01:51:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:51,534 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2024-09-13 01:51:51,534 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2024-09-13 01:51:51,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2024-09-13 01:51:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-13 01:51:51,538 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:51,538 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:51:51,550 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 01:51:51,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:51,743 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:51,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-09-13 01:51:51,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:51,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848693203] [2024-09-13 01:51:51,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:51:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891039875] [2024-09-13 01:51:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:51,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:51,786 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 01:51:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:51,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 01:51:51,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-13 01:51:52,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:51:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 01:51:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:52,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848693203] [2024-09-13 01:51:52,636 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:51:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891039875] [2024-09-13 01:51:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891039875] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:51:52,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:51:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-13 01:51:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078356610] [2024-09-13 01:51:52,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:51:52,637 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-13 01:51:52,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:52,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-13 01:51:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-09-13 01:51:52,638 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-13 01:51:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:53,009 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2024-09-13 01:51:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 01:51:53,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 85 [2024-09-13 01:51:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:53,011 INFO L225 Difference]: With dead ends: 145 [2024-09-13 01:51:53,011 INFO L226 Difference]: Without dead ends: 111 [2024-09-13 01:51:53,011 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-09-13 01:51:53,012 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:53,012 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 414 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 01:51:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-13 01:51:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-09-13 01:51:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-13 01:51:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-09-13 01:51:53,036 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 85 [2024-09-13 01:51:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:53,036 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-09-13 01:51:53,036 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-13 01:51:53,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-09-13 01:51:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 01:51:53,038 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:53,038 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-09-13 01:51:53,050 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-13 01:51:53,238 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:53,239 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:53,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1973508941, now seen corresponding path program 2 times [2024-09-13 01:51:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:53,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506871766] [2024-09-13 01:51:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:51:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:51:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:51:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:51:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:51:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:51:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:51:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:51:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:51:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:51:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:51:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:51:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 01:51:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 01:51:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 01:51:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:53,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506871766] [2024-09-13 01:51:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506871766] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:51:53,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33083748] [2024-09-13 01:51:53,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:51:53,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:53,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:53,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:53,421 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 01:51:53,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:51:53,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:51:53,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 01:51:53,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 01:51:53,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:51:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 01:51:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33083748] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:51:53,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:51:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-13 01:51:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927255103] [2024-09-13 01:51:53,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:51:53,566 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:51:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:51:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:51:53,568 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-13 01:51:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:53,625 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-09-13 01:51:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 01:51:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 87 [2024-09-13 01:51:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:53,626 INFO L225 Difference]: With dead ends: 124 [2024-09-13 01:51:53,626 INFO L226 Difference]: Without dead ends: 102 [2024-09-13 01:51:53,627 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:51:53,627 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:53,627 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:51:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-13 01:51:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-09-13 01:51:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 01:51:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-09-13 01:51:53,651 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 87 [2024-09-13 01:51:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:53,651 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-09-13 01:51:53,651 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-13 01:51:53,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-09-13 01:51:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-13 01:51:53,652 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:53,652 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:51:53,664 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 01:51:53,853 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 01:51:53,853 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:53,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -637517709, now seen corresponding path program 1 times [2024-09-13 01:51:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079534533] [2024-09-13 01:51:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:51:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:51:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:51:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:51:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:51:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:51:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:51:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:51:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,063 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:51:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:51:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,073 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:51:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:51:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 01:51:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 01:51:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 01:51:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 01:51:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079534533] [2024-09-13 01:51:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079534533] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:51:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923959478] [2024-09-13 01:51:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:54,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:54,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:54,095 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-13 01:51:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:54,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 01:51:54,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-13 01:51:54,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:51:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 01:51:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923959478] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:51:54,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:51:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-09-13 01:51:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679301404] [2024-09-13 01:51:54,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:51:54,698 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-13 01:51:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-13 01:51:54,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-13 01:51:54,699 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-13 01:51:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:54,930 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2024-09-13 01:51:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 01:51:54,931 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) Word has length 90 [2024-09-13 01:51:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:54,932 INFO L225 Difference]: With dead ends: 117 [2024-09-13 01:51:54,932 INFO L226 Difference]: Without dead ends: 100 [2024-09-13 01:51:54,933 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-13 01:51:54,933 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:54,933 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 384 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:51:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-13 01:51:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-09-13 01:51:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 01:51:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-13 01:51:54,954 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 90 [2024-09-13 01:51:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:54,955 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-13 01:51:54,955 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-13 01:51:54,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-13 01:51:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-13 01:51:54,956 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:54,956 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:51:54,968 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-13 01:51:55,159 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:55,160 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:55,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-09-13 01:51:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:55,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034753580] [2024-09-13 01:51:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:51:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:51:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:51:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:51:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:51:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:51:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:51:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:51:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:51:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:51:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:51:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:51:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-13 01:51:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 01:51:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 01:51:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-13 01:51:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 01:51:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034753580] [2024-09-13 01:51:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034753580] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:51:55,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009842408] [2024-09-13 01:51:55,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:55,265 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:55,266 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-13 01:51:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:51:55,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-13 01:51:55,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-13 01:51:55,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:51:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009842408] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:51:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 01:51:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-13 01:51:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933588189] [2024-09-13 01:51:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:51:55,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:51:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:51:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:51:55,331 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 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-13 01:51:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:51:55,387 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-13 01:51:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:51:55,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 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 94 [2024-09-13 01:51:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:51:55,389 INFO L225 Difference]: With dead ends: 100 [2024-09-13 01:51:55,389 INFO L226 Difference]: Without dead ends: 88 [2024-09-13 01:51:55,389 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:51:55,389 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:51:55,389 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:51:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-13 01:51:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-13 01:51:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 01:51:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2024-09-13 01:51:55,410 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 94 [2024-09-13 01:51:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:51:55,410 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2024-09-13 01:51:55,410 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 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-13 01:51:55,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2024-09-13 01:51:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-09-13 01:51:55,411 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:51:55,411 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:51:55,422 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-13 01:51:55,611 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:55,612 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:51:55,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:51:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -588826413, now seen corresponding path program 3 times [2024-09-13 01:51:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:51:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972467941] [2024-09-13 01:51:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:51:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:51:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:51:55,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621405421] [2024-09-13 01:51:55,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 01:51:55,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:51:55,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:51:55,645 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:51:55,647 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-13 01:51:56,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-13 01:51:56,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:51:56,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-13 01:51:56,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:51:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-09-13 01:51:56,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:52:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-09-13 01:52:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972467941] [2024-09-13 01:52:07,338 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:52:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621405421] [2024-09-13 01:52:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621405421] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:52:07,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:52:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-09-13 01:52:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277607904] [2024-09-13 01:52:07,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:52:07,339 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 01:52:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:07,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 01:52:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-09-13 01:52:07,340 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2024-09-13 01:52:12,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:13,917 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2024-09-13 01:52:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-13 01:52:13,917 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) Word has length 104 [2024-09-13 01:52:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:13,918 INFO L225 Difference]: With dead ends: 162 [2024-09-13 01:52:13,919 INFO L226 Difference]: Without dead ends: 140 [2024-09-13 01:52:13,919 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2024-09-13 01:52:13,919 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:13,919 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 433 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-09-13 01:52:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-13 01:52:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2024-09-13 01:52:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 38 states have call successors, (38), 15 states have call predecessors, (38), 14 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-13 01:52:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2024-09-13 01:52:13,953 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 104 [2024-09-13 01:52:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:13,954 INFO L474 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2024-09-13 01:52:13,954 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2024-09-13 01:52:13,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2024-09-13 01:52:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-13 01:52:13,955 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:13,955 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:13,961 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-13 01:52:14,159 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-13 01:52:14,160 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:14,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1973122394, now seen corresponding path program 2 times [2024-09-13 01:52:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:14,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036394793] [2024-09-13 01:52:14,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:14,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:52:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913934946] [2024-09-13 01:52:14,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:52:14,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:14,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:14,185 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:52:14,185 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-13 01:52:14,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:52:14,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:52:14,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-13 01:52:14,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:52:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 124 proven. 22 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-09-13 01:52:14,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:52:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-13 01:52:14,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:14,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036394793] [2024-09-13 01:52:14,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:52:14,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913934946] [2024-09-13 01:52:14,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913934946] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:52:14,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:52:14,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-09-13 01:52:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375487643] [2024-09-13 01:52:14,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:52:14,513 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-13 01:52:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-13 01:52:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-09-13 01:52:14,514 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-13 01:52:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:14,932 INFO L93 Difference]: Finished difference Result 142 states and 169 transitions. [2024-09-13 01:52:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 01:52:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 115 [2024-09-13 01:52:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:14,934 INFO L225 Difference]: With dead ends: 142 [2024-09-13 01:52:14,934 INFO L226 Difference]: Without dead ends: 140 [2024-09-13 01:52:14,934 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-09-13 01:52:14,934 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:14,935 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 216 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 01:52:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-13 01:52:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-09-13 01:52:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.1071428571428572) internal successors, (93), 88 states have internal predecessors, (93), 38 states have call successors, (38), 18 states have call predecessors, (38), 17 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-13 01:52:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2024-09-13 01:52:14,973 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 115 [2024-09-13 01:52:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:14,974 INFO L474 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2024-09-13 01:52:14,974 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-13 01:52:14,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2024-09-13 01:52:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-09-13 01:52:14,976 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:14,977 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:14,989 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-13 01:52:15,180 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-13 01:52:15,181 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:15,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1536141598, now seen corresponding path program 4 times [2024-09-13 01:52:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611399815] [2024-09-13 01:52:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:52:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:52:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:52:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:52:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:52:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:52:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:52:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:52:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:52:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:52:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:52:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:52:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-13 01:52:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 01:52:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 01:52:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-13 01:52:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-13 01:52:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-13 01:52:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-13 01:52:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-09-13 01:52:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611399815] [2024-09-13 01:52:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611399815] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:52:15,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855511574] [2024-09-13 01:52:15,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 01:52:15,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:15,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:15,420 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:52:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-13 01:52:15,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 01:52:15,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:52:15,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 01:52:15,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:52:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-09-13 01:52:15,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:52:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-09-13 01:52:15,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855511574] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:52:15,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:52:15,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-09-13 01:52:15,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128999065] [2024-09-13 01:52:15,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:52:15,621 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 01:52:15,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:15,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 01:52:15,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 01:52:15,622 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-09-13 01:52:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:15,734 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2024-09-13 01:52:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:52:15,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 117 [2024-09-13 01:52:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:15,735 INFO L225 Difference]: With dead ends: 167 [2024-09-13 01:52:15,735 INFO L226 Difference]: Without dead ends: 144 [2024-09-13 01:52:15,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 01:52:15,736 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:15,736 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:52:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-09-13 01:52:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-09-13 01:52:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 90 states have internal predecessors, (94), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-09-13 01:52:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2024-09-13 01:52:15,777 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 117 [2024-09-13 01:52:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:15,777 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2024-09-13 01:52:15,777 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-09-13 01:52:15,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2024-09-13 01:52:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-09-13 01:52:15,778 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:15,779 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:15,793 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-13 01:52:15,982 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-13 01:52:15,983 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:15,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash 47128766, now seen corresponding path program 2 times [2024-09-13 01:52:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:15,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560569447] [2024-09-13 01:52:15,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:15,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:52:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:52:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:52:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:52:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:52:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:52:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:52:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:52:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:52:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:52:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:52:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:52:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-13 01:52:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 01:52:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 01:52:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-13 01:52:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-13 01:52:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-13 01:52:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-13 01:52:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-13 01:52:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-13 01:52:16,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560569447] [2024-09-13 01:52:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560569447] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:52:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547136693] [2024-09-13 01:52:16,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:52:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:16,284 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:52:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-13 01:52:16,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:52:16,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:52:16,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-13 01:52:16,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:52:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-13 01:52:16,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:52:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-13 01:52:17,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547136693] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:52:17,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:52:17,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 30 [2024-09-13 01:52:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244147987] [2024-09-13 01:52:17,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:52:17,485 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-13 01:52:17,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:17,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-13 01:52:17,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2024-09-13 01:52:17,486 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-13 01:52:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:18,050 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2024-09-13 01:52:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 01:52:18,050 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) Word has length 120 [2024-09-13 01:52:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:18,051 INFO L225 Difference]: With dead ends: 158 [2024-09-13 01:52:18,051 INFO L226 Difference]: Without dead ends: 130 [2024-09-13 01:52:18,052 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2024-09-13 01:52:18,052 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:18,052 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 530 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 01:52:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-13 01:52:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-09-13 01:52:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 80 states have internal predecessors, (83), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-13 01:52:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2024-09-13 01:52:18,083 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 120 [2024-09-13 01:52:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:18,083 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2024-09-13 01:52:18,083 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-13 01:52:18,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2024-09-13 01:52:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-09-13 01:52:18,084 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:18,084 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:18,097 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-13 01:52:18,285 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-13 01:52:18,285 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:18,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1414642200, now seen corresponding path program 5 times [2024-09-13 01:52:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646729953] [2024-09-13 01:52:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:52:18,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430289341] [2024-09-13 01:52:18,330 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-13 01:52:18,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:18,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:18,331 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:52:18,332 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-13 01:52:18,409 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-09-13 01:52:18,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:52:18,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-09-13 01:52:18,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:52:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 82 proven. 101 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-09-13 01:52:18,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:53:37,061 WARN L293 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:54:26,323 WARN L293 SmtUtils]: Spent 9.60s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:55:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 82 proven. 101 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-09-13 01:55:23,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:55:23,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646729953] [2024-09-13 01:55:23,693 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:55:23,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430289341] [2024-09-13 01:55:23,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430289341] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:55:23,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:55:23,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-09-13 01:55:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527880439] [2024-09-13 01:55:23,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:55:23,694 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-13 01:55:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:55:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-13 01:55:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=805, Unknown=1, NotChecked=0, Total=992 [2024-09-13 01:55:23,695 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 32 states, 32 states have (on average 1.78125) internal successors, (57), 29 states have internal predecessors, (57), 19 states have call successors, (43), 3 states have call predecessors, (43), 2 states have return successors, (40), 15 states have call predecessors, (40), 17 states have call successors, (40) [2024-09-13 01:55:45,769 WARN L293 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 460 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:55:48,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:55:50,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:55:54,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:55:56,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:55:58,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:01,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:03,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:04,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:08,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:37,471 WARN L293 SmtUtils]: Spent 22.80s on a formula simplification. DAG size of input: 414 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:56:41,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:44,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:45,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:48,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:50,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:52,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:57,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:01,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:05,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:16,092 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 275 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:57:18,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:39,146 WARN L293 SmtUtils]: Spent 11.49s on a formula simplification. DAG size of input: 436 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:57:58,091 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 424 DAG size of output: 81 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:58:03,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:26,256 WARN L293 SmtUtils]: Spent 10.86s on a formula simplification. DAG size of input: 416 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:58:31,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:36,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:37,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:38,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:41,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:42,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:59:52,496 WARN L293 SmtUtils]: Spent 52.57s on a formula simplification. DAG size of input: 313 DAG size of output: 153 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:59:55,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:00:00,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:00:03,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:00:04,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:01:19,268 WARN L293 SmtUtils]: Spent 50.06s on a formula simplification. DAG size of input: 335 DAG size of output: 144 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:02:05,449 WARN L293 SmtUtils]: Spent 33.86s on a formula simplification. DAG size of input: 321 DAG size of output: 148 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:02:07,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:10,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:11,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:13,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:26,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:58,347 WARN L293 SmtUtils]: Spent 17.64s on a formula simplification. DAG size of input: 462 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:03:00,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:05,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:32,242 WARN L293 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 337 DAG size of output: 163 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:04:37,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:41,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:55,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:57,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:01,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:04,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:07,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:11,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:13,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:20,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:23,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:27,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:30,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:32,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:37,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:38,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:47,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:59,977 WARN L293 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 76 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:06:02,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] Killed by 15